DocumentCode
3318790
Title
A self adaptive coding scheme for text and binary data
Author
Desoky, Ahmed ; Klein, Thomas
Author_Institution
Dept. of Eng. Math & Comput. Sci., Louisville Univ., KY, USA
fYear
1989
fDate
9-12 Apr 1989
Firstpage
459
Abstract
An effort is made to measure the amount of compression that can be accomplished using a heuristic coding algorithm. The scheme is based on the locality of the input symbols within a self-adaptive sequential list. An IBM-PC-based system has been developed for both encoding and decoding. The results using different adaptive sequential lists are presented. The test data include text files and binary files such as computer programs in executable forms and a 256-gray-levels image. Performance evaluation is discussed in terms of compression ratio, encoding time, and decoding time
Keywords
adaptive systems; decoding; encoding; microcomputer applications; telecommunications computing; IBM-PC-based system; adaptive sequential lists; binary data; binary files; compression ratio; computer programs; decoding; encoding; heuristic coding algorithm; input symbols; performance evaluation; self adaptive coding; text files; Adaptive coding; Computer science; Data engineering; Decoding; Encoding; Frequency; Heuristic algorithms; Huffman coding; Mathematics; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Southeastcon '89. Proceedings. Energy and Information Technologies in the Southeast., IEEE
Conference_Location
Columbia, SC
Type
conf
DOI
10.1109/SECON.1989.132420
Filename
132420
Link To Document