Skip to main navigation Skip to search Skip to main content

Correcting grain-errors in magnetic media

Ryan Gabrys, Eitan Yaakobi, Lara Dolecek

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper studies new bounds and constructions that are applicable to the combinatorial granular channel model previously introduced by Sharov and Roth. The main theme of the paper is that codes capable of correcting grain-errors are related to codes that correct insertions/deletions and codes that correct asymmetric errors. Using this insight, new bounds on the maximum cardinality of a grain-error correcting code are derived and constructions of codes that correct grain-errors are considered. It is also demonstrated that permutations of the classical group codes can correct a single grain-error. In several cases of interest, our results improve upon the currently best known bounds and constructions.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages689-693
Number of pages5
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period7/07/1312/07/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Correcting grain-errors in magnetic media'. Together they form a unique fingerprint.

Cite this