An upper bound on the entropy of run-length coding (Corresp.)

DOI10.1109/TIT.1974.1055278MaRDI QIDQ4048962zbMATH OpenFDO

Authors Thomas S. Huang

Publication date 1974

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Recommendations

• Bounds on the entropy series
• An achievable bound for optimal noiseless coding of a random variable (Corresp.)
• On runlength codes
• scientific article; zbMATH DE number 1803256
• Runlength codes from source codes

Cited in

(3)

• Bounds on the entropy series
• A simple storage scheme for strings achieving entropy bounds
• On the capacity of M-ary runlength-limited codes

This page was built for publication: An upper bound on the entropy of run-length coding (Corresp.)

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