Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources .I. The regular case

DOI10.1109/18.887857zbMath0997.94541OpenAlexW2096473018MaRDI QIDQ2705978

Gil I. Shamir, Daniel J. jun. Costello

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3be7dfe28e9693bbc7aaf62aeaf02a2042d39b8c

zbMATH Keywords

upper boundslower boundredundancychange detectionsequential codingtransition pathlossless universal codingregular memoryless sources

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items

Textual data compression in computational biology: algorithmic techniques, Asymptotic property of universal lossless coding for independent piecewise identically distributed sources