Generalized multiplication-free arithmetic codes

DOI10.1109/26.592545MaRDI QIDQ4361497zbMATH OpenOpenAlexFDO

Authors Bin Fu, Keshab K. Parhi

Publication date 5 January 1998

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

code space alignmentlossless source codingmultiplication-free arithmetic codestruncation rounding

Mathematics Subject Classification ID

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

Recommendations

• Efficient multiplication-free arithmetic codes
• Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding
• An Introduction to Arithmetic Coding

Cited in

(5)

• Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding
• Finite-precision arithmetic coding via index-splitting and probability-fitting
• Efficient multiplication-free arithmetic codes
• scientific article; zbMATH DE number 3745093 (Why is no real title available?)
• scientific article; zbMATH DE number 1281613 (Why is no real title available?)

This page was built for publication: Generalized multiplication-free arithmetic codes

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