Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis

DOI10.1109/TIT.2019.2907979MaRDI QIDQ5224112zbMATH OpenOpenAlexFDO

Authors Mladen Kovačević

Publication date 19 July 2019

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

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

zbMATH Keywords

asymptotic behavior in the large block-lenghtsboundserror correction in bit-shift channelssize of optimal (d, k)-constrained code

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Abstract: This work is motivated by the problem of error correction in bit-shift channels with the so-called $(d,k)$ input constraints (where successive $1$'s are required to be separated by at least $d$ and at most $k$ zeros, $0leqd<kleqinfty$). Bounds on the size of optimal $(d,k)$-constrained codes correcting a fixed number of bit-shifts are derived, with a focus on their asymptotic behavior in the large block-length limit. The upper bound is obtained by a packing argument, while the lower bound follows from a construction based on a family of integer lattices. Several properties of $(d,k)$-constrained sequences that may be of independent interest are established as well; in particular, the exponential growth-rate of the number of $(d,k)$-constrained constant-weight sequences is characterized. The results are relevant for magnetic and optical information storage systems, reader-to-tag RFID channels, and other communication models where bit-shift errors are dominant and where $(d,k)$-constrained sequences are used for modulation.

Cited in

(5)

• Sequences and codes with asymmetrical runlength constraints
• scientific article; zbMATH DE number 4207992 (Why is no real title available?)
• A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
• On the capacity of M-ary runlength-limited codes
• Information-Theoretic Foundations of DNA Data Storage

This page was built for publication: Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis

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