• Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Jeanne Boyarsky
  • Ron McLeod
  • Paul Clapham
  • Liutauras Vilda
Sheriffs:
  • paul wheaton
  • Rob Spoor
  • Devaka Cooray
Saloon Keepers:
  • Stephan van Hulst
  • Tim Holloway
  • Carey Brown
  • Frits Walraven
  • Tim Moores
Bartenders:
  • Mikalai Zaikin

help in understanding LZ78 compressing method

 
Ranch Hand
Posts: 78
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
i cant understand this method

here is an example
we are tring to compress
abbacabbcbcd

and we get the result
of
(0,a) , (0,b), (2,a) , (0,c) , (1,b) , (2,c) , (6,d)

where the numbers are some sort of indicator for the char or a group
of chars

i cant figure out how they got those numbers
??

and what methods do i need to create in order to
build it??
[ December 29, 2007: Message edited by: johny doe ]
 
Ranch Hand
Posts: 1282
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator

Mastering Algorithms With C - OReilley.
The main idea behind LZ77 is to look continually for the longest phrase in the lookahead buffer that matches a phrase currently in the dictionary.

reply
    Bookmark Topic Watch Topic
  • New Topic