Constant-Weight and Constant-Charge Binary Run-Length Limited Codes

DOI10.1109/TIT.2011.2145490MaRDI QIDQ5273548zbMATH OpenFDO

Authors O. F. Kurmaev

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Elliptic functions and integrals (33E05) Combinatorial codes (94B25)

Abstract: Constant-weight and constant-charge binary sequences with constrained run length of zeros are introduced. For these sequences, the weight and the charge distribution are found. Then, recurrent and direct formulas for calculating the number of these sequences are obtained. With considering these numbers of constant-weight and constant-charge RLL sequences as coefficients of convergent power series, generating functions are derived. The fact, that generating function for enumerating constant-charge RLL sequences does not have a closed form, is proved. Implementation of encoding and decoding procedures using Cover's enumerative scheme is shown. On the base of obtained results, some examples, such as enumeration of running-digital-sum (RDS) constrained RLL sequences or peak-shifts control capability are also provided.

Cited in

(3)

• Duplication-correcting codes
• Enumerative coding for constant-weight binary sequences with constrained run-length of zeros
• Binary cyclic-gap constant weight codes with low-complexity encoding and decoding

This page was built for publication: Constant-Weight and Constant-Charge Binary Run-Length Limited Codes

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