On-line adaptive canonical prefix coding with bounded compression loss

DOI10.1109/18.904514zbMath1001.94024OpenAlexW2103744227MaRDI QIDQ4544456

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

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

Related Items (2)

Worst-Case Optimal Adaptive Prefix Coding ⋮ A fast algorithm for adaptive prefix coding

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