A Review of Data Compression Algorithms
United States. Defense Communications Agency. Command & Control Technical Center, C Holborrow, J McNemar, P Stoneburner
Defense Communications Agency, 1976 - Algorithms - 146 pages
This memorandum describes various methods for compressing digital computer data files. The objective of the methods described is to reduce the physical space required to store data while maintaining a complete representation of the information. There are several potential benefits associated with compression. It provides more efficient use of storage devices, it improves data transfer rates (through shorter message packets) and it permits faster data base access (through greater data density per I/O storage block). The document first discusses logical compression techniques and identifies some data base methods which minimize storage. Next, the document describes methods which achieve compression through various encoding schemes. The concepts for the development and operation of these methods are discussed, and guidance is provided for their appropriate application. Performance characteristics are delineated when operational statistics are known. (Author).
What people are saying - Write a review
We haven't found any reviews in the usual places.
VariableLength Coding For Characters and
Word Dictionary Techniques
6 other sections not shown
achieved acter algorithm allowable subalphabet alphanumeric ASCII best alphabetical encoding binary string bit map blank break characters bytes char character encoded character pair character set character string clustering procedure code associated codeword length codewords of length coding set coding table combined compressed string COMPRESSION CODING compression factor compression techniques COPAK cord Cullum data base DATA COMPACTION DATA COMPRESSION Data Types decoding tables decompression Detailed Description dictionary digits entries example extra bits Fibonacci code File Types fixed length code frequency Huffman codes Huffman codeword Incremental partial cost Information Theory integer intermediate logical compression loss in compaction method Modified Huffman Codes number of bits Octal overhead phrase prefix code probability vectors record Relative Effectiveness reordering repeat suppression retrieve routine Schwartz second clustering source alphabet source file suffix symbol SYNTAG total number Transition Distance Coding United States Patent variable length codes words zeros