Fast coding of low-entropy sources

DOI10.1109/18.796415MaRDI QIDQ4503476zbMATH OpenOpenAlexFDO

Authors M. P. Sharova, B. Ya. Ryabko

Publication date 7 September 2000

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

Full work available at URL https://semanticscholar.org/paper/8a3faa398a9a343e34b44e413a53822c6f1f0057

zbMATH Keywords

coding low-entropy information sourcesredundancyrun-length coding

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Recommendations

• Fast encoding of low-entropy sources
• scientific article; zbMATH DE number 1285526
• Fast and efficient coding of information sources
• scientific article; zbMATH DE number 1498788
• Efficient encoding of low-density parity-check codes
• scientific article; zbMATH DE number 1135099
• Decoding of low-density codes
• scientific article; zbMATH DE number 3361766
• Optimal encoding of non-stationary sources
• Coding low-entropy Markov sources with unknown statistics

Cited in

(6)

• Fast encoding of low-entropy sources
• An effective method for encoding information sources using the fast multiplication algorithm
• scientific article; zbMATH DE number 1285526 (Why is no real title available?)
• scientific article; zbMATH DE number 1285527 (Why is no real title available?)
• Fast and efficient coding of information sources
• scientific article; zbMATH DE number 1498788 (Why is no real title available?)

This page was built for publication: Fast coding of low-entropy sources

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