2000 character limit reached
Upper Bounds on the Size of Grain-Correcting Codes
Published 25 Feb 2013 in cs.DM, cs.IT, and math.IT | (1302.6154v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.