Compressing probability distributions

DOI10.1016/J.IPL.2005.10.006zbMath1184.68249arXivcs/0506016OpenAlexW2080686589MaRDI QIDQ1045918

Travis Gagie

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0506016

zbMATH Keywords

data compressiondata structures

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (1)

Large alphabets and incompressibility

Cites Work

• Unnamed Item
• Protocols for asymmetric communication channels
• Succinct Representation of Balanced Parentheses and Static Trees
• Dynamic Asymmetric Communication
• An application of informational divergence to Huffman codes
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• A simple upper bound on the redundancy of Huffman codes
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees
• A Method for the Construction of Minimum-Redundancy Codes
• On Information and Sufficiency

This page was built for publication: Compressing probability distributions