Bounds on compression of unknown alphabets

A. Orlitsky; N. P. Santhanam; J. Zhang

doi:10.1109/isit.2003.1228125

Bounds on compression of unknown alphabets

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

Research output: Contribution to journal › Conference article › peer-review

4 Scopus citations

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 language	English (US)
Pages (from-to)	111
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228125
State	Published - 2003
Externally published	Yes
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/isit.2003.1228125

Cite this

@article{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 J. Zhang",

year = "2003",

doi = "10.1109/isit.2003.1228125",

language = "English (US)",

pages = "111",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8096",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

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

}

TY - JOUR

T1 - Bounds on compression of unknown alphabets

AU - Orlitsky, A.

AU - Santhanam, N. P.

AU - Zhang, J.

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

U2 - 10.1109/isit.2003.1228125

DO - 10.1109/isit.2003.1228125

M3 - Conference article

AN - SCOPUS:0142008432

SN - 2157-8096

SP - 111

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

Bounds on compression of unknown alphabets

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this