Simple worst-case optimal adaptive prefix-free coding

DOI10.4230/LIPICS.ESA.2022.57MaRDI QIDQ6969625zbMATH OpenFDO

Authors Travis Gagie

Publication date 19 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2022.57

zbMATH Keywords

adaptive prefix-free codinglookup tablesShannon coding

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A fast algorithm for adaptive prefix coding
• A Mathematical Theory of Communication
• A Method for the Construction of Minimum-Redundancy Codes
• Algorithm 673
• Algorithms – ESA 2004
• Bounding the Compression Loss of the FGK Algorithm
• Design and analysis of dynamic Huffman codes
• Dynamic huffman coding
• scientific article; zbMATH DE number 3476581 (Why is no real title available?)
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• Huffman codes and self-information
• Surpassing the information theoretic bound with fusion trees
• Variations on a theme by Huffman
• Worst-Case Optimal Adaptive Prefix Coding

This page was built for publication: Simple worst-case optimal adaptive prefix-free coding

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