On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences

DOI10.1109/18.119694zbMath0761.94003OpenAlexW2175888699MaRDI QIDQ3990773

Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel

Publication date: 28 June 1992

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

Full work available at URL: https://semanticscholar.org/paper/922bae11b7d3d078c377d06415234f2abc7e1582

zbMATH Keywords

data compressionfinite-state sourcesfinite-state discriminatorsordering stringsuniversal ordering

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (2)

A new algorithm for compression of partially commutative alphabets ⋮ Optimal encoding of non-stationary sources

This page was built for publication: On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences