Generalized Shannon code minimizes the maximal redundancy

DOI10.1007/3-540-45995-2_29MaRDI QIDQ3044335zbMATH OpenFDO

Authors Michael Drmota, Wojciech Szpankowski

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860306.htm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• The Renyi redundancy of generalized Huffman codes
• On the redundancy achieved by Huffman codes
• Precise Minimax Redundancy and Regret
• Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
• scientific article; zbMATH DE number 6683480

Cited in

(7)

• Generalized Shannon codes
• Minimax trees in linear time with applications
• Individual redundancy of adaptive and weighted source coding
• Online binary minimax trees
• Minimax redundancy for the class of memoryless sources
• Does the Shannon bound really apply to all data structures?
• Dynamic Shannon coding

This page was built for publication: Generalized Shannon code minimizes the maximal redundancy

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