### Abstract

Standard redundancy measures the excess number of bits needed to compress sequences of a given length. Instead, we consider relative redundancy that measures the excess number of bits for sequences of a given minimum description length. Low relative redundancy implies that number of bits needed to compress any sequence is essentially the lowest possible. We show that low relative redundancy implies low standard redundancy, that while block relative redundancy resembles block standard redundancy, sequential relative redundancy is twice its counterpart, and that common algorithms achieving standard redundancy have unbounded relative redundancy.

Original language | English (US) |
---|---|

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

State | Published - Oct 20 2004 |

Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Relative redundancy: A more stringent performance guarantee for universal compression'. Together they form a unique fingerprint.

## Cite this

Orlitsky, A., Santhanam, N. P., & Zhang, J. (2004). Relative redundancy: A more stringent performance guarantee for universal compression.

*IEEE International Symposium on Information Theory - Proceedings*.