On the covering radius of some modular codes
Open Access
- 1 January 2014
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 8 (2) , 129-137
Abstract
This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{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 $\mathbb{Z}_4$.
Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- On quaternary MacDonald codes2004
- 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
- On ℤ4-Simplex Codes and Their Gray ImagesLecture Notes in Computer Science, 1999
- Z/sub 2/k-linear codesIEEE Transactions on Information Theory, 1998
- Type II codes over Z/sub 4/IEEE Transactions on Information Theory, 1997
- Quaternary quadratic residue codes and unimodular latticesIEEE Transactions on Information Theory, 1995
- Self-dual codes over the integers modulo 4Journal of Combinatorial Theory, Series A, 1993
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985