New bounds on D-ary optimal codes
DOI10.1016/J.IPL.2005.07.004zbMATH Open1191.68295OpenAlexW2114254535MaRDI QIDQ1044733FDOQ1044733
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
Recommendations
optimal codesredundancyinformation retrievalHuffman coding\(D\)-ary codesdense codesfrequency distributions
Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- A Method for the Construction of Minimum-Redundancy Codes
- \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
- Variations on a theme by Huffman
- Code and parse trees for lossless source encoding
- Existence of optimal prefix codes for infinite source alphabets
- Optimal source codes for geometrically distributed integer alphabets (Corresp.)
- On lower bounds for the redundancy of optimal codes
- Tight bounds on the redundancy of Huffman codes
- A note on D-ary Huffman codes
- Fixed-prefix encoding of the integers can be Huffman-optimal
- Huffman coding with an infinite alphabet
- Algorithms for infinite Huffman-codes
Cited In (9)
- On the redundancy of \(D\)-ary Fano codes
- New lower bounds for asymmetric and unidirectional codes
- Title not available (Why is that?)
- New Bounds and Constructions for Granular Media Coding
- Title not available (Why is that?)
- A New Upper Bound for the Dimension of Trace Codes
- New upper bounds on Lee codes
- New constructions of optimal subsystem codes
- New sufficient existence conditions for the codes that meet the Varshamov-Griesmer bound
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)
