Abstract/Details

Arithmetic Coding and the Move-To-Front method: A study of two data compression schemes

Klein, Thomas Joseph.   University of Louisville ProQuest Dissertations & Theses,  1989. 1337737.

Abstract (summary)

As applications requiring large data files become more common on personal computers a need arises to reduce data file storage requirements. Arithmetic Coding and the Move-To-Front method have been proposed as techniques displaying compression performances superior to the Huffman method. Arithmetic Coding represents a message as an interval of real numbers between 0 and 1. The longer the message, the smaller the interval needed to represent it, and thus the more bits needed to specify the interval. The Move-To-Front method is a locally adaptive heuristic technique that takes advantage of locality of reference, which occurs when symbols are used frequently over intervals and then fall into periods of disuse. This thesis examines Arithmetic Coding and the Move-To-Front method as possible compression techniques to reduce storage requirements for various classes of data. Models are presented along with their performance in specific applications.

Indexing (details)


Subject
Computer science
Classification
0984: Computer science
Identifier / keyword
Applied sciences
Title
Arithmetic Coding and the Move-To-Front method: A study of two data compression schemes
Author
Klein, Thomas Joseph
Number of pages
167
Degree date
1989
School code
0110
Source
MAI 28/01M, Masters Abstracts International
ISBN
979-8-207-44448-2
Advisor
Desoky, Ahmed H.
University/institution
University of Louisville
University location
United States -- Kentucky
Degree
M.S.
Source type
Dissertation or Thesis
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
1337737
ProQuest document ID
303725202
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Document URL
https://www.proquest.com/docview/303725202