Upper Bounds on the Size of Grain-Correcting Codes

DOI10.1109/TIT.2014.2329008MaRDI QIDQ2986214zbMATH OpenOpenAlexFDO

Authors N. Kashyap, Gilles Zémor

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1302.6154

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

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.

Cited in

(3)

• New Bounds and Constructions for Granular Media Coding
• Griffith–Kelly–Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes
• Improved upper bounds on sizes of codes

This page was built for publication: Upper Bounds on the Size of Grain-Correcting Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986214)