New bounds on D-ary optimal codes

DOI10.1016/J.IPL.2005.07.004MaRDI QIDQ1044733zbMATH OpenOpenAlexFDO

Authors 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

optimal codesredundancyinformation retrievalHuffman coding\(D\)-ary codesdense codesfrequency distributions

Mathematics Subject Classification ID

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

Recommendations

• A note on D-ary Huffman codes
• On lower bounds for the redundancy of optimal codes
• Tight bounds on the redundancy of Huffman codes
• New bounds on the expected length of one-to-one codes
• Bounding the Average Length of Optimal Source Codes Via Majorization Theory

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A note on D-ary Huffman codes
• Algorithms for infinite Huffman-codes
• Code and parse trees for lossless source encoding
• Existence of optimal prefix codes for infinite source alphabets
• Fixed-prefix encoding of the integers can be Huffman-optimal
• Huffman coding with an infinite alphabet
• On lower bounds for the redundancy of optimal codes
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Tight bounds on the redundancy of Huffman codes
• Variations on a theme by Huffman
• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.

Cited in

(9)

• On the redundancy of D-ary Fano codes
• New lower bounds for asymmetric and unidirectional codes
• scientific article; zbMATH DE number 6694244 (Why is no real title available?)
• New Bounds and Constructions for Granular Media Coding
• A New Upper Bound for the Dimension of Trace Codes
• scientific article; zbMATH DE number 6472192 (Why is no real title available?)
• New upper bounds on Lee codes
• New sufficient existence conditions for the codes that meet the Varshamov-Griesmer bound
• New constructions of optimal subsystem codes

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

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