DocumentCode
3020243
Title
Asymptotically optimal low complexity sequential lossless coding for regular piecewise stationary memoryless sources
Author
Shamir, G.I. ; Costello, D.J. ; Merhav, N.
Author_Institution
Dept. of Electr. Eng., Notre Dame Univ., IN, USA
fYear
1999
fDate
25-25 June 1999
Firstpage
72
Lastpage
74
Abstract
The lower bound on the redundancy for lossless universal coding of regular memoryless sources with abruptly changing statistics is shown to be achievable using a fixed per-letter computational complexity strongly sequential compression scheme with logarithmic storage complexity.
Keywords
computational complexity; memoryless systems; redundancy; sequential codes; source coding; abruptly changing statistics; asymptotically optimal low complexity sequential lossless coding; fixed per-letter computational complexity strongly sequential compression scheme; logarithmic storage complexity; lossless universal coding; lower bound; redundancy; regular memoryless sources; regular piecewise stationary memoryless sources; Arithmetic; Computational complexity; Gas insulated transmission lines; Source coding; Statistical distributions; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE
Conference_Location
Kruger National Park, South Africa
Print_ISBN
0-7803-5268-8
Type
conf
DOI
10.1109/ITCOM.1999.781413
Filename
781413
Link To Document