Title :
Asymptotically optimal threshold based low complexity sequential lossless coding for piecewise stationary memoryless sources
Author :
Shamir, G.I. ; Costello, D.J.
Author_Institution :
Dept. of Electr. Eng., Notre Dame Univ., IN, USA
fDate :
June 27 1999-July 1 1999
Abstract :
The lower bound on the redundancy for lossless universal coding of memoryless sources with abruptly changing statistics is shown to be achievable using a fixed per-letter computational complexity threshold based strongly sequential compression scheme.
Keywords :
computational complexity; memoryless systems; redundancy; sequential codes; source coding; asymptotically optimal threshold; fixed per-letter computational complexity; lossless universal coding; low complexity; lower bound; piecewise stationary memoryless sources; redundancy; sequential compression scheme; sequential lossless coding; Arithmetic; Entropy; Gas insulated transmission lines; Neural networks; Partitioning algorithms; Source coding; Statistics; Testing;
Conference_Titel :
Information Theory and Networking Workshop, 1999
Conference_Location :
Metsovo, Greece
Print_ISBN :
0-7803-5954-2
DOI :
10.1109/ITNW.1999.814342
