High dimensional error-correcting codes
Authors:
- 1 June 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1178-1182
Abstract
In this paper we construct multidimensional codes with high dimension. The codes can correct high dimensional errors which have the form of either small clusters, or confined to an area with a small radius. We also consider small number of errors in a small area. The clusters which are discussed are mainly spheres such as semi-crosses and crosses. Also considered are clusters with small number of errors such as 2-bursts, two errors in various clusters, and three errors on a line. Our main focus is on the redundancy of the codes when the most dominant parameter is the dimension of the code.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Error-Correction of Multidimensional BurstsIEEE Transactions on Information Theory, 2009
- Two-Dimensional Cluster-Correcting CodesIEEE Transactions on Information Theory, 2005
- Two-dimensional burst identification codes and their use in burst correctionIEEE Transactions on Information Theory, 1988
- On the existence of optimum cyclic burst correcting codes over GF(q)IEEE Transactions on Information Theory, 1988
- On the existence of optimum cyclic burst- correcting codesIEEE Transactions on Information Theory, 1986
- Packings ofR^nby certain error spheresIEEE Transactions on Information Theory, 1984
- Combinatorial packings ofR^3by certain error spheresIEEE Transactions on Information Theory, 1984
- Perfect Codes in the Lee Metric and the Packing of PolyominoesSIAM Journal on Applied Mathematics, 1970
- A general formulation of error matrices (Corresp.)IEEE Transactions on Information Theory, 1969