Optimal source codes for geometrically distributed integer alphabets (Corresp.)

DOI10.1109/TIT.1975.1055357MaRDI QIDQ4053471zbMATH OpenWikidataFDO

Authors Robert G. Gallager, David C. van Voorhis

Publication date 1975

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(9)

• New bounds on \(D\)-ary optimal codes
• Universal coding for memoryless sources with countably infinite alphabets
• Huffman-type codes for infinite source distributions
• Searching and encoding for infinite ordered sets
• Supporting random access in files of variable length records
• Asymptotic analysis of optimal nested group-testing procedures
• A combinatorial approach to Golomb forests
• Parallel lossless image compression using Huffman and arithmetic coding
• Optimal Prefix Codes And Huffman Codes

This page was built for publication: Optimal source codes for geometrically distributed integer alphabets (Corresp.)

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