On Octonary Codes and their Covering Radii
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 Z8. 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 α and Type β and their duals, MacDonald codes, and Reed-Muller codes over Z8.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.