Upper bounds on the size of grain-correcting codes

In this paper, we re-visit the combinatorial error model of Mazumdar et al. [3] 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.

• Publication year

  2013

• Venue

  2013 IEEE International Symposium on Information Theory

• Publication date

  2013-02-25

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2014.2329008arXiv 1302.6154
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Correcting Grain-Errors in Magnetic Media

  2013cited by this paper
• Nonasymptotic Upper Bounds for Deletion Correcting Codes

  2012influential reference
• Coding and Detection for Rectangular-Grain TDMR Models

  2011cited by this paper
• Bounds and constructions for granular media coding

  2011influential reference
• Coding for High-Density Recording on a 1-D Granular Magnetic Medium

  2010cited by this paper
• Write Channel Model for Bit-Patterned Media Recording

  2010cited by this paper
• The Feasibility of Magnetic Recording at 10 Terabits Per Square Inch on Conventional Media

  2009cited by this paper
• Packing Problems and Hypergraph Theory: A Survey

  1979cited by this paper

• Coding Constructions for Efficient Oblivious Transfer From Noisy Channels

  2020cites this paper
• Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography

  2019cites this paper
• Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel

  2017cites this paper
• Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels

  2016cites this paper
• New Bounds and Constructions for Granular Media Coding

  2014cites this paper
• Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels

  2014cites this paper
• Generalized Sphere Packing Bound

  2014cites this paper
• Generalized sphere packing bound: Basic principles

  2014cites this paper
• New upper bounds for grain-correcting and grain-detecting codes

  2014cites this paper
• Generalized sphere-packing upper bounds on the size of codes for combinatorial channels

  2014cites this paper
• Improved bounds and constructions for granular media coding

  2013cites this paper
• Correcting Grain-Errors in Magnetic Media

  2013cites this paper
• Coding for New Applications in Storage Media

  2011influential citation
• Bounds and constructions for granular media coding

  2011cites this paper