Universal lossless coding of sources with large and unbounded alphabets

被引：2
|
作者：
Yang, EH [1 ]
Jia, YW [1 ]
机构：
[1] Univ Waterloo, Dept E&CE, Waterloo, ON N2L 3G1, Canada
来源：
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2000年
关键词：
D O I：
10.1109/ISIT.2000.866306
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A multilevel arithmetic coding algorithm is proposed to encode data sequences with large or unbounded source alphabets. The algorithm is universal in the sense that it can achieve asymptotically the entropy rate of any independently and identically distributed integer source with a finite or infinite alphabet, as long as the mean value is finite.
引用
收藏
页码：16 / 16
页数：1
相关论文
共 50 条
  • [21] Universal compression of memoryless sources over unknown alphabets
    Orlitsky, A
    Santhanam, NP
    Zhang, JA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (07) : 1469 - 1481
  • [22] Universal D-Semifaithfull Coding for Countably Infinite Alphabets
    Silva, Jorge F.
    Piantanida, Pablo
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 567 - 571
  • [23] Almost Lossless Variable-Length Source Coding on Countably Infinite Alphabets
    Silva, Jorge F.
    Piantanida, Pablo
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1 - 5
  • [24] ON UNIVERSAL NOISELESS SOURCE-CODING FOR INFINITE SOURCE ALPHABETS
    GYORFI, L
    PALI, I
    VANDERMEULEN, EC
    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1993, 4 (02): : 125 - 132
  • [25] Universal coding of integers and unbounded search trees
    Ahlswede, R
    Han, TS
    Kobayashi, K
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (02) : 669 - 682
  • [26] On Lossless Universal Compression of Distributed Identical Sources
    Beirami, Ahmad
    Fekri, Faramarz
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 561 - 565
  • [27] Applications of coding theory to universal lossless source coding performance bounds
    Shamir, GI
    ALGEBRAIC CODING THEORY AND INFORMATION THEORY, 2005, 68 : 21 - 55
  • [28] Universal compression of Markov and related sources over arbitrary alphabets
    Dhulipala, Anand K.
    Orlitsky, Alon
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (09) : 4182 - 4190
  • [29] PRACTICAL LENGTH-LIMITED CODING FOR LARGE ALPHABETS
    TURPIN, A
    MOFFAT, A
    COMPUTER JOURNAL, 1995, 38 (05): : 339 - 347
  • [30] Universal coding of nonstationary sources
    Visweswariah, K
    Kulkarni, SR
    Verdú, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1633 - 1637
12345