A substitutional compression scheme which works by entering phrases into a dictionary and then, when a reoccurrence of that particular phrase is found, outputting the dictionary index instead of the phrase. Several algorithms are based on this principle, differing mainly in the manner in which they manage the dictionary. The most well-known Lempel-Ziv scheme is Terry Welch' s Lempel-Ziv Welch variant of LZ78. [comp.compression FAQ].

In addition suitable contents:
[ = ] [ ad ] [ ag ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ ba ] [ base ] [ bs ] [ by ] [ cc ] [ ch ] [ ci ] [ co ] [ com ] [ compress ] [ compression ] [ cu ] [ de ] [ diff ] [ du ] [ ed ] [ er ] [ era ] [ es ] [ FAQ ] [ fi ] [ file ] [ fo ] [ ge ] [ h ] [ hat ] [ hm ] [ hr ] [ id ] [ iff ] [ il ] [ in ] [ inc ] [ index ] [ int ] [ io ] [ is ] [ it ] [ kn ] [ la ] [ lc ] [ Lex ] [ ly ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ nc ] [ ne ] [ ng ] [ nl ] [ nn ] [ no ] [ ns ] [ om ] [ output ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ Q ] [ query ] [ rc ] [ re ] [ S ] [ sc ] [ se ] [ si ] [ st ] [ su ] [ T ] [ th ] [ to ] [ tp ] [ tt ] [ va ] [ var ] [ ve ] [ Z ]