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 条
  • [41] On asymptotically optimal sequential lossless coding for memoryless switching sources
    Shamir, GI
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 124 - 124
  • [42] Compressing Multisets with Large Alphabets using Bits-Back Coding
    Severo, Daniel
    Townsend, James
    Khisti, Ashish
    Makhzani, Alireza
    Ullrich, Karen
    arXiv, 2021,
  • [43] A Simple and Efficient Approach for Adaptive Entropy Coding Over Large Alphabets
    Painsky, Amichai
    Rosset, Saharon
    Feder, Meir
    2016 DATA COMPRESSION CONFERENCE (DCC), 2016, : 369 - 378
  • [44] Universal coding for correlated sources with complementary delivery
    Kimura, Akisato
    Uyematsu, Tomohiko
    Kuzuoka, Shigeaki
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (09) : 1840 - 1847
  • [45] Universal coding for correlated sources with linked encoders
    Oohama, Y
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) : 837 - 847
  • [46] Universal coding for correlated sources with complementary delivery
    Kimura, Akisato
    Uyematsu, Tomohiko
    Kuzuoka, Shigeaki
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1756 - +
  • [47] MINIMAX NOISELESS UNIVERSAL CODING FOR MARKOV SOURCES
    DAVISSON, LD
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 211 - 215
  • [48] Universal compression of unknown alphabets
    Jevtic, N
    Orlitsky, A
    Santhanam, N
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 320 - 320
  • [49] On demand string sorting over unbounded alphabets
    Kent, Carmel
    Lewenstein, Moshe
    Sheinwald, Dafna
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 16 - +
  • [50] Analysis of Lossless Compression for a Large Class of Sources of Information
    Munteanu, Valeriu
    Tarniceriu, Daniela
    Zaharia, Gheorghe
    ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS,, 2009, : 545 - +
12345