scientific article; zbMATH DE number 1543071

MaRDI QIDQ4520527zbMATH OpenFDO

Authors Ioan Tomescu, Cristian S. Calude

Publication date 26 February 2001

Full work available at URL http://www.jucs.org/jucs_3_11/optimum_extendible_prefix_codes

zbMATH Keywords

Huffman's algorithmoptimum extendible prefix code

Mathematics Subject Classification ID

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

Recommendations

• Optimum extensions of prefix codes.
• scientific article; zbMATH DE number 4063000
• Optimum '1'-ended binary prefix codes
• scientific article; zbMATH DE number 1543056
• Existence of optimal prefix codes for infinite source alphabets

Cited in

(8)

• Optimum extensions of prefix codes.
• Worst-Case Optimal Adaptive Prefix Coding
• Optimal Prefix Codes And Huffman Codes
• scientific article; zbMATH DE number 1535454 (Why is no real title available?)
• scientific article; zbMATH DE number 1543056 (Why is no real title available?)
• On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources
• An optimum encoding with minimum longest code and total number of digits
• A note on the construction of error detecting/correcting prefix codes

This page was built for publication:

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