New bounds on \(D\)-ary optimal codes

DOI10.1016/J.IPL.2005.07.004zbMath1191.68295OpenAlexW2114254535MaRDI QIDQ1044733

Gonzalo Navarro, Nieves R. Brisaboa

Publication date: 18 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.07.004

zbMATH Keywords

information retrievalredundancyoptimal codesHuffman coding\(D\)-ary codesdense codesfrequency distributions

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)

Related Items (1)

On the redundancy of \(D\)-ary Fano codes

Cites Work

• Unnamed Item
• On lower bounds for the redundancy of optimal codes
• Code and parse trees for lossless source encoding
• A note on D-ary Huffman codes
• Fixed-prefix encoding of the integers can be Huffman-optimal
• Tight bounds on the redundancy of Huffman codes
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Variations on a theme by Huffman
• Existence of optimal prefix codes for infinite source alphabets
• Huffman coding with an infinite alphabet
• A Method for the Construction of Minimum-Redundancy Codes
• String Processing and Information Retrieval

This page was built for publication: New bounds on \(D\)-ary optimal codes