Back to Search
Start Over
Upper Bounds on the Size of Grain-Correcting Codes.
- Source :
-
IEEE Transactions on Information Theory . Aug2014, Vol. 60 Issue 8, p4699-4709. 11p. - Publication Year :
- 2014
-
Abstract
- In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature. [ABSTRACT FROM PUBLISHER]
- Subjects :
- *CRYSTAL grain boundaries
*BINARY codes
*COMBINATORICS
*HYPERGRAPHS
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 60
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 97068637
- Full Text :
- https://doi.org/10.1109/TIT.2014.2329008