On the Covering Radius of Some Modular Codes
Preprint
Abstract
This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Shadow Codes over Z4Finite Fields and Their Applications, 2001
- On the covering radius of Z/sub 4/-codes and their latticesIEEE Transactions on Information Theory, 1999
- Type II codes, even unimodular lattices, and invariant ringsIEEE Transactions on Information Theory, 1999
- Type II Self-Dual Codes over Finite Rings and Even Unimodular LatticesJournal of Algebraic Combinatorics, 1999
- Self-dual codes over rings and the Chinese remainder theoremHokkaido Mathematical Journal, 1999
- Double circulant self-dual codes over Z/sub 2k/IEEE Transactions on Information Theory, 1998
- Codes and Projective MultisetsThe Electronic Journal of Combinatorics, 1998
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groupsIEEE Transactions on Information Theory, 1996
- Quaternary quadratic residue codes and unimodular latticesIEEE Transactions on Information Theory, 1995
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codesIEEE Transactions on Information Theory, 1994