Loading [MathJax]/extensions/MathMenu.js
Relative redundancy: a more stringent performance guarantee for universal compression | IEEE Conference Publication | IEEE Xplore

Relative redundancy: a more stringent performance guarantee for universal compression


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 n...Show More

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.
Date of Conference: 27 June 2004 - 02 July 2004
Date Added to IEEE Xplore: 10 January 2005
Print ISBN:0-7803-8280-3
Conference Location: Chicago, IL, USA

References

References is not available for this document.