Bounds on compression of unknown alphabets

A. Orlitsky, N. P. Santhanam, Junan Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

It is known that the redundancy of universally compressing i.i.d, strings increases to infinity as the alphabet size grows. It is also apparent that any string can be described by separately conveying its symbols, and their pattern - the order in which they appear. Concentrating on the latter, we show that the patterns of iid strings drawn from any, possibly infinite or even unknown, alphabet, can be universally compressed with diminishing worst-case redundancy, both in block, and sequentially.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages111
Number of pages1
StatePublished - 2003
Externally publishedYes
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Other

OtherProceedings 2003 IEEE International Symposium on Information Theory (ISIT)
CountryJapan
CityYokohama
Period6/29/037/4/03

Fingerprint

Redundancy
Conveying

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Orlitsky, A., Santhanam, N. P., & Zhang, J. (2003). Bounds on compression of unknown alphabets. In IEEE International Symposium on Information Theory - Proceedings (pp. 111)

Bounds on compression of unknown alphabets. / Orlitsky, A.; Santhanam, N. P.; Zhang, Junan.

IEEE International Symposium on Information Theory - Proceedings. 2003. p. 111.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Orlitsky, A, Santhanam, NP & Zhang, J 2003, Bounds on compression of unknown alphabets. in IEEE International Symposium on Information Theory - Proceedings. pp. 111, Proceedings 2003 IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, 6/29/03.
Orlitsky A, Santhanam NP, Zhang J. Bounds on compression of unknown alphabets. In IEEE International Symposium on Information Theory - Proceedings. 2003. p. 111
Orlitsky, A. ; Santhanam, N. P. ; Zhang, Junan. / Bounds on compression of unknown alphabets. IEEE International Symposium on Information Theory - Proceedings. 2003. pp. 111
@inproceedings{56ec382247484dab90aff1cf5fbc02ba,
title = "Bounds on compression of unknown alphabets",
abstract = "It is known that the redundancy of universally compressing i.i.d, strings increases to infinity as the alphabet size grows. It is also apparent that any string can be described by separately conveying its symbols, and their pattern - the order in which they appear. Concentrating on the latter, we show that the patterns of iid strings drawn from any, possibly infinite or even unknown, alphabet, can be universally compressed with diminishing worst-case redundancy, both in block, and sequentially.",
author = "A. Orlitsky and Santhanam, {N. P.} and Junan Zhang",
year = "2003",
language = "English (US)",
pages = "111",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Bounds on compression of unknown alphabets

AU - Orlitsky, A.

AU - Santhanam, N. P.

AU - Zhang, Junan

PY - 2003

Y1 - 2003

N2 - It is known that the redundancy of universally compressing i.i.d, strings increases to infinity as the alphabet size grows. It is also apparent that any string can be described by separately conveying its symbols, and their pattern - the order in which they appear. Concentrating on the latter, we show that the patterns of iid strings drawn from any, possibly infinite or even unknown, alphabet, can be universally compressed with diminishing worst-case redundancy, both in block, and sequentially.

AB - It is known that the redundancy of universally compressing i.i.d, strings increases to infinity as the alphabet size grows. It is also apparent that any string can be described by separately conveying its symbols, and their pattern - the order in which they appear. Concentrating on the latter, we show that the patterns of iid strings drawn from any, possibly infinite or even unknown, alphabet, can be universally compressed with diminishing worst-case redundancy, both in block, and sequentially.

UR - http://www.scopus.com/inward/record.url?scp=0142008432&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142008432&partnerID=8YFLogxK

M3 - Conference contribution

SP - 111

BT - IEEE International Symposium on Information Theory - Proceedings

ER -