Correcting Grain-Errors in Magnetic Media

This paper studies new bounds and code constructions that are applicable to the combinatorial granular channel model previously introduced by Sharov and Roth. We derive new bounds on the maximum cardinality of a grain-error-correcting code and propose constructions of codes that correct grain-errors...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 61; no. 5; pp. 2256 - 2272
Main Authors: Gabrys, Ryan, Yaakobi, Eitan, Dolecek, Lara
Format: Journal Article
Language:English
Published: New York IEEE 01.05.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Additives
Channel models
Context
Error correction & detection
Information theory
Magnetic recording
Mathematical models
Media
Upper bound
Vectors
Algebraic-coding theory
coding for storage
group codes
granular media
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies new bounds and code constructions that are applicable to the combinatorial granular channel model previously introduced by Sharov and Roth. We derive new bounds on the maximum cardinality of a grain-error-correcting code and propose constructions of codes that correct grain-errors. We demonstrate that a permutation of the classical group codes (e.g., Constantin-Rao codes) can correct a single grain-error. In many cases of interest, our results improve upon the currently best known bounds and constructions. Some of the approaches adopted in the context of grain-errors may have application to related channel models.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2015.2409860