Optimal Parsing Trees for Run-Length Coding of Biased Data

DOI10.1109/TIT.2007.913570zbMATH Open1311.94042OpenAlexW2116949556MaRDI QIDQ3604465FDOQ3604465

Authors: Jack Keil Wolf, Sharon Aviran, Paul Siegel 

Publication date: 24 February 2009

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

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

Recommendations

• Runlength codes from source codes
• Capacity achieving code constructions for two classes of (d,k) constraints
• Coding of run-length-limited sequences
• scientific article; zbMATH DE number 1301974
• A new approach to constructing optimal block codes for runlength-limited channels

Mathematics Subject Classification ID

Source coding (94A29)

This page was built for publication: Optimal Parsing Trees for Run-Length Coding of Biased Data

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