Table 5.11: Final dictionary for abababab Entry Index Entry 1 9 a ababa 2 10 b ababab 3 11 ab 4 12 ba bababa 5 13 aba abababa 6 14 abab abababab 7 15 bab bababab 8 baba Source alphabet A = {a,b} Encode the sequence ababababab ------- Transmitted sequence 1 2 3 5-------- Decoding: Begin with initial dictionary (Table 5.10). (1, 2) decoded as (a,b) leads to 3rd entry Next input is 3 (gives Next is 4 ab. ab). (gives See table (5.14). Next input is 5. Not in the dictionary ba). 5.5 Applications: LZW is one of the most widely used compression algorithms. Table 5.13: Constructing the fifth entry (stage one) Index Entry 1 a 2 b 3 ab 4 ba 5 a… Table 5.14: Constructing the fifth entry (stage two)
Table 5.11: Final dictionary for abababab Entry Index Entry 1 a 9 ababa 2 b 10 ababab 3 ab 11 4 ba 12 bababa 5 aba 13 abababa 6 abab 14 abababab 7 bab 15 bababab 8 baba Source alphabet A = {a,b} Encode the sequence ababababab ------- Transmitted sequence 1 2 3 5-------- Decoding: Begin with initial dictionary (Table 5.10). (1, 2) decoded as (a,b) leads to 3rd entry ab. Next input is 3 (gives ab). Next is 4 (gives ba). See table (5.14). Next input is 5. Not in the dictionary 5.5 Applications: LZW is one of the most widely used compression algorithms. Table 5.13: Constructing the fifth entry (stage one) Index Entry 1 a 2 b 3 ab 4 ba 5 a… Table 5.14: Constructing the fifth entry (stage two)
Dictionary_Tech.docx