On Octonary Codes and their Covering Radii

Manoj K. Raut; Manish K. Gupta

On Octonary Codes and their Covering Radii

Information Theory 2014-12-10 v3 math.IT

Authors: Manoj K. Raut , Manish K. Gupta

Abstract

This paper introduces new reduction and torsion codes for an octonary code and determines their basic properties. These could be useful for the classification of self-orthogonal and self dual codes over $\mathbb{Z}_8$ . We also focus our attention on covering radius problem of octonary codes. In particular, we determine lower and upper bounds of the covering radius of several classes of Repetition codes, Simplex codes of Type $\alpha$ and Type $\beta$ and their duals, MacDonald codes, and Reed-Muller codes over $\mathbb{Z}_8$ .

Keywords

coding theory maximum distance separable code

Cite

@article{arxiv.1411.1822,
  title  = {On Octonary Codes and their Covering Radii},
  author = {Manoj K. Raut and Manish K. Gupta},
  journal= {arXiv preprint arXiv:1411.1822},
  year   = {2014}
}

Comments

16 pages, some errors fixed

Related papers

View all related →