Upper Bounds on the Size of Grain-Correcting Codes
arXiv:1302.6154
Abstract
In this paper, we re-visit 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.
This is an extended version of a paper submitted to the 2013 IEEE International Symposium on Information Theory (ISIT 2013). Material from Sections 1, 2, 3 and 6 of this version were submitted to ISIT 2013. Version v4 contains updated figures and a new Section 5