Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics

被引:97
作者
Kontoyiannis, Ioannis [1 ]
Verdu, Sergio [2 ]
机构
[1] Athens U Econ & Business, Dept Informat, Athens 10675, Greece
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
Lossless data compression; fixed-to-variable source coding; fixed-to-fixed source coding; entropy; finite-block length fundamental limits; central limit theorem; Markov sources; varentropy; minimal coding variance; source dispersion; EXPECTED LENGTH; BOUNDS; PROBABILITY; ENTROPY;
D O I
10.1109/TIT.2013.2291007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper provides an extensive study of the behavior of the best achievable rate (and other related fundamental limits) in variable-length strictly lossless compression. In the nonasymptotic regime, the fundamental limits of fixed-to-variable lossless compression with and without prefix constraints are shown to be tightly coupled. Several precise, quantitative bounds are derived, connecting the distribution of the optimal code lengths to the source information spectrum, and an exact analysis of the best achievable rate for arbitrary sources is given. Fine asymptotic results are proved for arbitrary (not necessarily prefix) compressors on general mixing sources. Nonasymptotic, explicit Gaussian approximation bounds are established for the best achievable rate on Markov sources. The source dispersion and the source varentropy rate are defined and characterized. Together with the entropy rate, the varentropy rate serves to tightly approximate the fundamental nonasymptotic limits of fixed-to-variable compression for all but very small block lengths.
引用
收藏
页码:777 / 795
页数:19
相关论文
共 44 条
  • [1] A LOWER-BOUND ON THE EXPECTED LENGTH OF ONE-TO-ONE CODES
    ALON, N
    ORLITSKY, A
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) : 1670 - 1672
  • [2] [Anonymous], 2011, INFORM THEORY CODING, DOI DOI 10.1017/CBO9780511921889
  • [3] [Anonymous], 2006, Elements of Information Theory
  • [4] [Anonymous], 1996, GRADUATE STUDIES MAT
  • [5] [Anonymous], 2009, MARKOV CHAINS STOCHA
  • [6] Barron A. R., 1985, THESIS STANFORD U ST
  • [7] New bounds on the expected length of one-to-one codes
    Blundo, C
    DePrisco, R
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (01) : 246 - 250
  • [8] Bradley R. C., 1986, DEPENDENCE PROBABILI, P165
  • [9] Bounds on the expected length of optimal one-to-one codes
    Cheng, Jay
    Huang, Tien-Ke
    Weidmann, Claudio
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (05) : 1884 - 1895
  • [10] Chung K., 1974, A course in probability theory