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 | |
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