Existence of optimal prefix codes for infinite source alphabets

DOI10.1109/18.641571MaRDI QIDQ4392408zbMATH OpenOpenAlexFDO

Authors Vahid Tarokh, Kenneth Zeger, Tamás Linder

Publication date 8 June 1998

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6b63503d0be4d54a8e537d30aae52259415cfed6

zbMATH Keywords

Huffman codesinfinite codeKraft's inequalityprefix codes

Mathematics Subject Classification ID

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

Recommendations

• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
• Optimal source coding for a class of integer alphabets (Corresp.)
• scientific article; zbMATH DE number 3910298
• scientific article; zbMATH DE number 3981087
• Universal coding for memoryless sources with countably infinite alphabets
• Algorithms and Data Structures
• The characterization of maximal prefix codes
• Bounding the inefficiency of length-restricted prefix codes
• Infinite two-dimensional strong prefix codes: characterization and properties

Cited in

(19)

• New bounds on \(D\)-ary optimal codes
• Infinite two-dimensional strong prefix codes: characterization and properties
• Huffman-type codes for infinite source distributions
• On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
• On the competitive optimality of Huffman codes
• The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• scientific article; zbMATH DE number 3981087 (Why is no real title available?)
• Optimal source coding for a class of integer alphabets (Corresp.)
• scientific article; zbMATH DE number 2036351 (Why is no real title available?)
• Optimal Prefix Codes And Huffman Codes
• scientific article; zbMATH DE number 1543071 (Why is no real title available?)
• Optimal synchronous coding
• Competitive optimality of source codes
• Huffman coding with an infinite alphabet
• Practical algorithms for generating a random ordering of the elements of a weighted set
• On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources
• Algorithms for infinite Huffman-codes
• A combinatorial approach to Golomb forests

This page was built for publication: Existence of optimal prefix codes for infinite source alphabets

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