An effective method for encoding information sources using the fast multiplication algorithm

MaRDI QIDQ1925337zbMATH OpenFDO

Authors B. Ya. Ryabko

Publication date 15 December 1996

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

Markov sourcesBernoulli information sourcescomplexity of encoding and decodingencoding information sources

Mathematics Subject Classification ID

Source coding (94A29) Parallel algorithms in computer science (68W10)

Recommendations

• Fast and efficient coding of information sources
• Fast encoding of low-entropy sources
• Fast coding of low-entropy sources
• scientific article; zbMATH DE number 1285526

Cited in

(6)

• Error propagation assessment of enumerative coding schemes
• scientific article; zbMATH DE number 3427206 (Why is no real title available?)
• scientific article; zbMATH DE number 4127149 (Why is no real title available?)
• Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding
• Fast enumeration of combinatorial objects
• Fast and efficient coding of information sources

This page was built for publication: An effective method for encoding information sources using the fast multiplication algorithm

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