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

zbMATH Open0901.94013MaRDI QIDQ1925337FDOQ1925337

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)

Cited In (4)

• Error propagation assessment of enumerative coding schemes
• Fast and efficient coding of information sources
• Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding
• Fast enumeration of combinatorial objects

   Recommendations

• Fast and efficient coding of information sources 👍 👎
• Fast encoding of low-entropy sources 👍 👎
• Fast coding of low-entropy sources 👍 👎
• Title not available (Why is that?) 👍 👎

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)