Kashyap, Navin and Zemor, Gilles (2014) Upper Bounds on the Size of Grain-Correcting Codes. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 60 (8). pp. 4699-4709.
![]() |
PDF
iee_tra_inf_the_60-8_4659_2014.pdf - Published Version Restricted to Registered users only Download (667kB) | Request a copy |
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.
Item Type: | Journal Article |
---|---|
Publication: | IEEE TRANSACTIONS ON INFORMATION THEORY |
Publisher: | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
Additional Information: | Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA |
Keywords: | Fractional coverings; grain-correcting codes; high-density magnetic recording |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 04 Sep 2014 11:04 |
Last Modified: | 04 Sep 2014 11:04 |
URI: | http://eprints.iisc.ac.in/id/eprint/49764 |
Actions (login required)
![]() |
View Item |