# On Octonary Codes and their Covering Radii

Source: [On Octonary Codes and their Covering Radii](<https://www.sota2.com/research/paper/68fa515d1e209131ce9734d2>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T11:22:23.109Z

Authors: Manoj K. Raut, Manish K. Gupta

Published: 2014-11-07T04:34:59.000Z

## 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$.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1411.1822>)

[PDF](<https://arxiv.org/pdf/1411.1822.pdf>)