Compressing probability distributions

DOI10.1016/J.IPL.2005.10.006MaRDI QIDQ1045918zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: We show how to store good approximations of probability distributions in small space.

Cites work

• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• A Method for the Construction of Minimum-Redundancy Codes
• A simple upper bound on the redundancy of Huffman codes
• An application of informational divergence to Huffman codes
• Dynamic Asymmetric Communication
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• On Information and Sufficiency
• Protocols for asymmetric communication channels
• Succinct representation of balanced parentheses and static trees
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees

Cited in

(2)

• Old and new results on alphabetic codes
• Large alphabets and incompressibility

This page was built for publication: Compressing probability distributions

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