| dc.contributor.author | Choi, Sunny | |
| dc.date.accessioned | 2015-01-27T21:17:50Z | |
| dc.date.available | 2015-01-27T21:17:50Z | |
| dc.date.issued | 1989-12-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/14146 | |
| dc.description.abstract | One of the purposes of this research was to introduce several well-known text compression methods and to test them in order to compare their performances, not only with each other, but also with results from various previous researches. Welch's implementation of the Ziv-Lempel method was found to outperform any other single method introduced in this thesis, or any combination of methods. One other purpose of this research was to calculate the average distance from any one bit to the next synchronization point in static Huffman decoding, following a decoding error. The average distance in words decoded was predicted to be the average length of a codeword in bits, and tests on resynchronization showed that this was a good prediction. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Comparison of Methods for Text Compression | |
| dc.type | text | |
| osu.filename | Thesis-1989-C545c.pdf | |
| osu.accesstype | Open Access | |
| dc.description.department | Computing and Information Science | |
| dc.type.genre | Thesis | |
