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

DOI10.1109/TIT.1978.1055813zbMATH Open0368.94010OpenAlexW2029049260MaRDI QIDQ4145259FDOQ4145259

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (14)

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

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)