An entropy theorem for computing the capacity of weakly (d,k)-constrained sequences

DOI10.1109/18.841180zbMath0999.94024OpenAlexW2131147205MaRDI QIDQ4503571

Kees Schouhamer Immink, Augustus J. E. M. Janssen

Publication date: 7 September 2000

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

Full work available at URL: https://research.tue.nl/nl/publications/an-entropy-theorem-for-computing-the-capacity-of-weakly-d-kconstrained-sequences(13d114d5-320e-4428-9e29-d7fc4f84cc6c).html

zbMATH Keywords

capacitymagnetic recordingnormalized entropyconstrained codeRLL sequencerunlength limited

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

This page was built for publication: An entropy theorem for computing the capacity of weakly (d,k)-constrained sequences