| dc.description.abstract | The purpose of this research was to study three commonly known efficient parsing problems of LZ adaptive dictionary compression schemes. They are the efficiency of finding the longest match between the look-ahead buffer and the text window, coding redundancy and parsing strategies. We introduced an AVL tree data structure to the original LZSS variant and the Knuth-Moore-Pratt string matching algorithm to the LZ77 variant, and compared their performances. We also tried to modify the one-bit flag fixed length coding method of LZSS to a two-bit flag variable length coding method and investigated the effort. Finally, we discussed a newly presented Non-Greedy parsing strategy. Acknowledgments and thanks go to my thesis advisor Professor John Chandler for his great help, guidance, and patience during the entire work. My thanks also go to Dr. Huizhu Lu and Dr. K.M. George for their helpful suggestions to my research. I also wish to give thanks to Dr. Kathleen Kaplan who spent a lot of time to answer my questions on string matching and generously lent me all the related papers and books. I am very thankful for the love and encouragement from my families, my parents, my mother-in-law, my younger brother, especially my wife Kaiping Deng. I cannot imagine, without all the help from these kind people, I could have finished my research on time. | |
