Upper Bounds on the Size of Grain-Correcting Codes

Navin Kashyap; Gilles Zémor

doi:10.1109/tit.2014.2329008

ScienceGate Book Chapters

JOURNAL ARTICLE

Upper Bounds on the Size of Grain-Correcting Codes

Navin Kashyap Gilles Zémor

Year: 2014 Journal: IEEE Transactions on Information Theory Vol: 60 (8)Pages: 4699-4709 Publisher: Institute of Electrical and Electronics Engineers

DOI: 10.1109/tit.2014.2329008

Get Full-Text PDF Get Analytical Report

Abstract

In this paper, we re-visit the combinatorial error model of Mazumdar et al.\nthat models errors in high-density magnetic recording caused by lack of\nknowledge of grain boundaries in the recording medium. We present new upper\nbounds on the cardinality/rate of binary block codes that correct errors within\nthis model.\n

Keywords:

Hypergraph Upper and lower bounds Cardinality (data modeling) Binary number Block (permutation group theory) Mathematics Discrete mathematics Low-density parity-check code Block size Combinatorics Computer science Algorithm Decoding methods Arithmetic Data mining

Metrics

Cited By

4.83

FWCI (Field Weighted Citation Impact)

Refs

0.95

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

DNA and Biological Computing

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Cellular Automata and Applications

Physical Sciences → Computer Science → Computational Theory and Mathematics

Upper Bounds on the Size of Grain-Correcting Codes

Abstract

Metrics

Citation History

Topics

Related Documents

New upper bounds for grain-correcting and grain-detecting codes

Upper bounds on the size of error‐correcting runlength‐limited codes

New upper bounds on the size of codes correcting asymmetric errors (Corresp.)

Upper bounds on codes correcting asymmetric errors (Corresp.)

Upper bounds for constant weight error correcting codes