scientific article; zbMATH DE number 2036351

MaRDI QIDQ4445809zbMATH OpenFDO

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

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)

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.)

Cited in

(19)

• Optimal causal coding - decoding problems
• Optimal Prefix Codes And Huffman Codes
• scientific article; zbMATH DE number 4041776 (Why is no real title available?)
• Optimal coding of elements of a metric space
• Optimal source coding for a class of integer alphabets (Corresp.)
• Average-sense optimality and competitive optimality for almost instantaneous VF codes
• scientific article; zbMATH DE number 1983209 (Why is no real title available?)
• Optimal binary one-ended codes
• Is Huffmann coding dead?
• Efficient Coding and Risky Choice
• Worst-Case Optimal Adaptive Prefix Coding
• On the cost of worst case coding length constraints
• An optimum encoding with minimum longest code and total number of digits
• Huffman coding in bit-vector compression
• scientific article; zbMATH DE number 4148826 (Why is no real title available?)
• On a new method of coding of information
• Optimal Index Codes With Near-Extreme Rates
• A novel block-based scheme for arithmetic coding
• Optimal synchronous coding

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)