On Covering Radius of Codes Over $R=\mathbb Z_2+u\mathbb Z_2,$ where $u^2=0$ Using Bachoc Distance


Abstract views: 8 / PDF downloads: 4

Authors

  • P. Chella Pandian Department of Mathematics, Srimad Andavan Arts and Science College (Autonomous), Tiruchirappalli, Tamilnadu, India

Keywords:

Covering radius, Codes over finite rings, Simplex code, MacDonald code

Abstract

In this paper, we give lower and upper bounds on the covering radius of codes over the ring $R=\mathbb Z_2+u\mathbb Z_2,$ where $u^2=0$ with bachoc distance and also obtain the covering radius of various Repetition codes, Simplex codes of $\alpha$-Type code and $\beta$-Type code. We give bounds on the covering radius for MacDonald codes of both types over $R=\mathbb Z_2+u\mathbb Z_2.$

Downloads

Published

15-11-2017

How to Cite

P. Chella Pandian. (2017). On Covering Radius of Codes Over $R=\mathbb Z_2+u\mathbb Z_2,$ where $u^2=0$ Using Bachoc Distance. International Journal of Mathematics And Its Applications, 5(4 - C), 277–282. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1269

Issue

Vol. 5 No. 4 - C (2017)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.