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

DOI10.1109/18.841180MaRDI QIDQ4503571zbMATH OpenOpenAlexFDO

Authors Kees Schouhamer Immink, A. 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

capacitynormalized entropymagnetic recordingconstrained codeRLL sequencerunlength limited

Mathematics Subject Classification ID

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

Recommendations

• Equalities among Capacities of (d,k)-Constrained Systems
• On runlength codes
• On the capacity of two-dimensional run-length constrained channels
• Entropy of underdetermined sequences under constraints to specifications
• scientific article; zbMATH DE number 2104030

Cited in

(4)

• On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
• Topological entropies of a class of constrained systems
• Entropy of underdetermined sequences under constraints to specifications
• scientific article; zbMATH DE number 2104030 (Why is no real title available?)

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

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