Runlength codes from source codes

DOI10.1109/18.79932MaRDI QIDQ3358642zbMATH OpenOpenAlexFDO

Authors Kenneth J. Kerpez

Publication date 1991

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

Full work available at URL https://doi.org/10.1109/18.79932

zbMATH Keywords

arithmetic codebinary runlength codeslossless source codemaxentropic distributionmaximum entropymodulation code

Mathematics Subject Classification ID

Source coding (94A29) Prefix, length-variable, comma-free codes (94A45) Arithmetic codes (94B40)

Recommendations

• On runlength codes
• Optimal Parsing Trees for Run-Length Coding of Biased Data
• On runlength-limited coding with DC control
• Almost-Certainly Runlength-Limiting Codes
• A general error-correcting code construction for run-length limited binary channels

Cited in

(4)

• Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping
• Optimal Parsing Trees for Run-Length Coding of Biased Data
• On runlength codes
• An upper bound on the entropy of run-length coding (Corresp.)

This page was built for publication: Runlength codes from source codes

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