The context tree weighting method: Some ideas

P.A.J. Volf, F.M.J. Willems

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

The context tree weighting algorithm was introduced at the 1993 ISIT. Here we are concerned with the context tree maximizing algorithm. We discuss two modifications of this algorithm.
Original languageEnglish
Title of host publicationProc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology
EditorsH.C.A. Tilborg, van, F.M.J. Willems
Pages27-27
Publication statusPublished - 1994
Eventconference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994 -
Duration: 1 Jan 1994 → …

Conference

Conferenceconference; Proc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994
Period1/01/94 → …
OtherProc. EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Veldhoven, Netherlands, 19-21 December 1994

Fingerprint

Dive into the research topics of 'The context tree weighting method: Some ideas'. Together they form a unique fingerprint.

Cite this