Universal coding for memoryless sources with countably infinite alphabets

DOI10.1134/S0032946014040085zbMath1398.94082OpenAlexW2001147081MaRDI QIDQ2352641

A. V. Porov, Boris D. Kudryashov

Publication date: 3 July 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946014040085

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Cites Work

• Compression for Multimedia
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• The performance of universal encoding
• Universal codeword sets and representations of the integers
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)
• Compression of individual sequences via variable-rate coding
• There is no universal source code for an infinite source alphabet
• Coding on Countably Infinite Alphabets
• Run-length encodings (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal coding for memoryless sources with countably infinite alphabets