On-line adaptive canonical prefix coding with bounded compression loss

DOI10.1109/18.904514MaRDI QIDQ4544456zbMATH OpenOpenAlexFDO

Authors Andrew Turpin, Alistair Moffat

Publication date 4 August 2002

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

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

zbMATH Keywords

adaptive MRP codingminimum-redundance prefix coding

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Worst-Case Optimal Adaptive Prefix Coding
• A fast algorithm for adaptive prefix coding
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 1630078
• Publication:4945375

Cited in

(8)

• A fast algorithm for adaptive prefix coding
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• Bidirectional adaptive compression
• scientific article; zbMATH DE number 1630078 (Why is no real title available?)
• Housekeeping for prefix coding
• Worst-Case Optimal Adaptive Prefix Coding
• Bounding the Compression Loss of the FGK Algorithm
• An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results

This page was built for publication: On-line adaptive canonical prefix coding with bounded compression loss

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