Optimal source coding for a class of integer alphabets (Corresp.)

DOI10.1109/TIT.1978.1055813MaRDI QIDQ4145259zbMATH OpenOpenAlexFDO

Authors Pierre A. Humblet

Publication date 1978

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

Full work available at URL https://doi.org/10.1109/tit.1978.1055813

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• scientific article; zbMATH DE number 2036351
• Huffman coding with an infinite alphabet
• Huffman-type codes for infinite source distributions
• Existence of optimal prefix codes for infinite source alphabets

Cited in

(14)

• A queueing network with a single cyclically roving server
• Almost asymptotically optimal flag encoding of the integers
• Polling systems with synchronization constraints
• scientific article; zbMATH DE number 4041776 (Why is no real title available?)
• scientific article; zbMATH DE number 2036351 (Why is no real title available?)
• A combinatorial approach to Golomb forests
• Fixed-prefix encoding of the integers can be Huffman-optimal
• Huffman-type codes for infinite source distributions
• Source Coding for Quasiarithmetic Penalties
• Bit probabilities of optimal binary source codes
• Two conjectures about recency rank encoding
• Efficient Integer Coding for Arbitrary Probability Distributions
• Existence of optimal prefix codes for infinite source alphabets
• On the redundancy of lossy source coding with abstract alphabets

This page was built for publication: Optimal source coding for a class of integer alphabets (Corresp.)

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