Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
The Construction of Near-optimal Universal Coding of Integers
Wei Yan, Yunghsiang S. Han
The Universal Coding of Integers~(UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class…
cs.IT2026
About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
Hongyang Liu, Wei Yan
For the discrete memoryless sources with a countably infinite alphabet, we prove that for any positive integer , there exists a corresponding probability interval such that if t…