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 条

[1] Universal lossless compression of piecewise stationary slowly varying sources
Shamir, GI
Costello, DJ
DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2001, : 371 - 380
[2] Low complexity sequential lossless coding for piecewise stationary memoryless sources
Shamir, GI
Merhav, N
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 47 - 47
[3] Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
Suko, Tota
Matsushima, Toshiyasu
Hirasawa, Shigeichi
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2010, 13 (04): : 383 - 391
[4] Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
Shamir, GI
Merhav, N
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) : 1498 - 1519
[5] Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
IEEE
不详
不详
IEEE Trans. Inf. Theory, 5 (1498-1519):
[6] Universal lossless coding for sources with repeating statistics
Shamir, GI
Costello, DJ
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1620 - 1635
[7] Universal lossless coding of sources with large and unbounded alphabets
Yang, EH
Jia, YW
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 16 - 16
[8] Joint Universal Lossy Coding and Identification of Stationary Mixing Sources With General Alphabets
Raginsky, Maxim
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (05) : 1945 - 1960
[9] The Redundancy Gains of Almost Lossless Universal Source Coding over Envelope Families
Silva, Jorge F.
Piantanida, Pablo
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2003 - 2007
[10] Universal coding for memoryless sources with respect to the criterion of relative redundancy
Shtar'kov, Yu.M.
Problemy Peredachi Informatsii, 1991, 27 (04): : 9 - 16

← 1 2 3 4 5 →