Optimal universal coding with respect to the maximal individual relative redundancy criterion

Yu.M. Shtarkov; T.J. Tjalkens; F.M.J. Willems

doi:10.1109/ISIT.1997.613357

Optimal universal coding with respect to the maximal individual relative redundancy criterion

Yu.M. Shtarkov, T.J. Tjalkens, F.M.J. Willems

Signal Processing Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior.

Original language	English
Title of host publication	Procodedings of IEEE International Symposium on Information Theory, 29 June-4 July 1997
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	420
Number of pages	1
ISBN (Print)	0-7803-3956-8
DOIs	https://doi.org/10.1109/ISIT.1997.613357
Publication status	Published - 1997
Event	1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: 29 Jun 1997 → 4 Jul 1997

Conference

Conference	1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/Territory	Germany
City	Ulm
Period	29/06/97 → 4/07/97
Other	Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, 29 June - 2 July 1997

Access to Document

10.1109/ISIT.1997.613357

Cite this

@inproceedings{97073533c44f4aa78584b632846d487c,

title = "Optimal universal coding with respect to the maximal individual relative redundancy criterion",

abstract = "In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior.",

author = "Yu.M. Shtarkov and T.J. Tjalkens and F.M.J. Willems",

year = "1997",

doi = "10.1109/ISIT.1997.613357",

language = "English",

isbn = "0-7803-3956-8",

pages = "420",

booktitle = "Procodedings of IEEE International Symposium on Information Theory, 29 June-4 July 1997",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "1997 IEEE International Symposium on Information Theory, ISIT 1997 ; Conference date: 29-06-1997 Through 04-07-1997",

}

Shtarkov, YM, Tjalkens, TJ & Willems, FMJ 1997, Optimal universal coding with respect to the maximal individual relative redundancy criterion. in Procodedings of IEEE International Symposium on Information Theory, 29 June-4 July 1997., 613357, Institute of Electrical and Electronics Engineers, Piscataway, pp. 420, 1997 IEEE International Symposium on Information Theory, ISIT 1997, Ulm, Germany, 29/06/97. https://doi.org/10.1109/ISIT.1997.613357

Optimal universal coding with respect to the maximal individual relative redundancy criterion. / Shtarkov, Yu.M.; Tjalkens, T.J.; Willems, F.M.J.
Procodedings of IEEE International Symposium on Information Theory, 29 June-4 July 1997. Piscataway: Institute of Electrical and Electronics Engineers, 1997. p. 420 613357.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Optimal universal coding with respect to the maximal individual relative redundancy criterion

AU - Shtarkov, Yu.M.

AU - Tjalkens, T.J.

AU - Willems, F.M.J.

PY - 1997

Y1 - 1997

N2 - In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior.

AB - In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior.

U2 - 10.1109/ISIT.1997.613357

DO - 10.1109/ISIT.1997.613357

M3 - Conference contribution

SN - 0-7803-3956-8

SP - 420

BT - Procodedings of IEEE International Symposium on Information Theory, 29 June-4 July 1997

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997

Y2 - 29 June 1997 through 4 July 1997

ER -

Optimal universal coding with respect to the maximal individual relative redundancy criterion

Abstract

Conference

Access to Document

Fingerprint

Cite this