Efficient Integer Coding for Arbitrary Probability Distributions

DOI10.1109/TIT.2006.878089MaRDI QIDQ3548074zbMATH OpenOpenAlexFDO

Authors Shengtian Yang, Pei-Liang Qiu

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Optimal probabilistic dense coding schemes
• A probability-ratio approach to approximate binary arithmetic coding
• A rapid probability estimator and binary arithmetic coder
• Optimal random coding
• Optimal source coding for a class of integer alphabets (Corresp.)
• Integer-Forcing Source Coding
• Bit probabilities of optimal binary source codes
• scientific article; zbMATH DE number 1734711
• Finite-precision arithmetic coding via index-splitting and probability-fitting
• scientific article; zbMATH DE number 4133978

Cited in

(3)

• scientific article; zbMATH DE number 4133978 (Why is no real title available?)
• Structured prefix codes for quantized low-shape-parameter generalized Gaussian sources
• Run-Length Encoding in a Finite Universe

This page was built for publication: Efficient Integer Coding for Arbitrary Probability Distributions

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