Title :
Poissonization and universal compression of envelope classes
Author :
Acharya, Jayadev ; Jafarpour, Ashkan ; Orlitsky, Alon ; Suresh, A.T.
Author_Institution :
ECE, UCSD, La Jolla, CA, USA
fDate :
June 29 2014-July 4 2014
Abstract :
Poisson sampling is a method for eliminating dependence among symbols in a random sequence. It helps improve algorithm design, strengthen bounds, and simplify proofs. We relate the redundancy of fixed-length and Poisson-sampled sequences, use this result to derive a simple formula for the redundancy of general envelope classes, and apply this formula to obtain simple and tight bounds on the redundancy of power-law and exponential envelope classes, in particular answering a question posed in [1] about power-law envelopes.
Keywords :
data compression; random sequences; stochastic processes; Poisson sampling; Poisson-sampled sequences; Poissonization; algorithm design; exponential envelope classes; fixed-length sequences; power-law; random sequence; universal compression; Approximation methods; Random variables; Redundancy; Source coding; Upper bound;
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
DOI :
10.1109/ISIT.2014.6875158
