scientific article; zbMATH DE number 2036351

zbMATH Open1031.68819MaRDI QIDQ4445809FDOQ4445809

Authors: Dong-Yang Long, Weijia Jia 

Publication date: 2 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2195/21950094.htm

Title of this publication is not available (Why is that?)

Recommendations

• Existence of optimal prefix codes for infinite source alphabets
• Optimal Prefix Codes And Huffman Codes
• Huffman coding with an infinite alphabet
• Algorithms for infinite Huffman-codes
• Optimal source coding for a class of integer alphabets (Corresp.)

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (18)

• Is Huffmann coding dead?
• On a new method of coding of information
• Title not available (Why is that?)
• Worst-Case Optimal Adaptive Prefix Coding
• Optimal causal coding - decoding problems
• Title not available (Why is that?)
• Optimal source coding for a class of integer alphabets (Corresp.)
• An optimum encoding with minimum longest code and total number of digits
• Title not available (Why is that?)
• Huffman coding in bit-vector compression
• Optimal binary one-ended codes
• Optimal synchronous coding
• Efficient Coding and Risky Choice
• Average-sense optimality and competitive optimality for almost instantaneous VF codes
• On the cost of worst case coding length constraints
• Optimal Index Codes With Near-Extreme Rates
• Optimal coding of elements of a metric space
• Optimal Prefix Codes And Huffman 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 Q4445809)