Context-tree weighting for text-sources

P.A.J. Volf

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)

    Abstract

    The context-tree weighting (CTW) algorithm is a universal source coding algorithm for binary tree sources. This paper presents 3 techniques that modify the CTW algorithm for non-binary, and especially for ASCII-character oriented, tree sources.
    Original languageEnglish
    Title of host publicationProceedings of IEEE International Symposium on Information Theory 29 June-4 July 1997
    Place of PublicationPiscataway
    PublisherInstitute of Electrical and Electronics Engineers
    Pages64-
    Number of pages1
    ISBN (Print)0-7803-3956-8
    DOIs
    Publication statusPublished - 1997
    Eventconference; Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, 29 June - 2 July 1997 -
    Duration: 1 Jan 1997 → …

    Conference

    Conferenceconference; Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, 29 June - 2 July 1997
    Period1/01/97 → …
    OtherProc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, 29 June - 2 July 1997

    Fingerprint

    Dive into the research topics of 'Context-tree weighting for text-sources'. Together they form a unique fingerprint.

    Cite this