Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Maximal codeword lengths in Huffman codes

From MaRDI portal
Jump to:navigation, search

DOI10.1016/S0898-1221(00)00119-XzbMATH Open0965.94008OpenAlexW2076789254MaRDI QIDQ1570107FDOQ1570107


Authors: N. Delaunay Edit this on Wikidata


Publication date: 9 July 2000

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(00)00119-x




Recommendations

  • On the maximum length of Huffman codes
  • The length of a typical Huffman codeword
  • Tight bounds on the redundancy of Huffman codes
  • The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
  • On the redundancy of binary Huffman codes (Corresp.)


zbMATH Keywords

data compressionFibonacci numberHuffman codinglongest Huffman codeword


Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)


Cites Work

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Variations on a theme by Huffman
  • Huffman codes and self-information


Cited In (1)

  • The length of a typical Huffman codeword





This page was built for publication: Maximal codeword lengths in Huffman codes

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1570107&oldid=13850998"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 01:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki