On the redundancy of universal lossless coding for general piecewise stationary sources

被引：1
|
作者：
Shamir, GI [1 ]
Costello, DJ [1 ]
机构：
[1] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA
来源：
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2000年
关键词：
D O I：
10.1109/ISIT.2000.866624
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A lower bound on the achievable redundancy for universal lossless coding of parametric sources with abruptly changing statistics is derived. Unlike the previously known bound for a problem that assumes a fixed number of changes in the statistics, the new bound is general and can be used even if the number of changes increases with the data length.
引用
收藏
页码：326 / 326
页数：1
相关论文
共 50 条
  • [21] On the asymptotic redundancy of lossless block coding with two codeword lengths
    Figueroa, E
    Houdré, C
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (02) : 688 - 692
  • [22] Piecewise Mapping in HEVC Lossless Intra-Prediction Coding
    Sanchez, Victor
    Auli-Llinas, Francesc
    Serra-Sagrista, Joan
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2016, 25 (09) : 4004 - 4017
  • [23] On Lossless Universal Compression of Distributed Identical Sources
    Beirami, Ahmad
    Fekri, Faramarz
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 561 - 565
  • [24] Universal fixed-length coding redundancy
    Chang, Cheng
    Sahai, Anant
    2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 535 - 540
  • [25] On the redundancy of universal trellis lossy source coding
    Yang, J
    Zhang, Z
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 168 - 168
  • [26] The redundancy of universal fixed rate source coding
    Yang, EH
    Zhang, Z
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 172 - 172
  • [27] On the asymptotics of the minimax redundancy arising in a universal coding
    Szpankowski, W
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 349 - 349
  • [28] Applications of coding theory to universal lossless source coding performance bounds
    Shamir, GI
    ALGEBRAIC CODING THEORY AND INFORMATION THEORY, 2005, 68 : 21 - 55
  • [29] Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
    Drmota, Michael
    Szpankowski, Wojciech
    FOUNDATIONS AND TRENDS IN COMMUNICATIONS AND INFORMATION THEORY, 2016, 13 (04): : 277 - 417
  • [30] Redundancy of the MTF scheme for stationary ergodic sources
    Arimura, M
    Yamamoto, H
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 289 - 289
12345