Abstract :
The use of data compression to reduce bandwidth and reduce storage requirements is discussed. The merits of lossless versus lossy compression techniques, the latter offering far greater compression ratios, are considered. The limits of lossless compression are discussed, and a simple method for lossless compression, runlength encoding, is described, as are the more sophisticated Huffman codes, arithmetic coding, and the trie-based codes invented by A. Lempel and J. Ziv (1977, 1978), WAN applications as well as throughput and latency are briefly considered.<>
Keywords :
Huffman codes; bandwidth compression; data compression; encoding; Huffman codes; WAN; applications; arithmetic coding; bandwidth; compression ratios; data compression; latency; lossless compression; lossy compression; runlength encoding; storage requirements; throughput; trie-based codes; Access protocols; Bandwidth; Compression algorithms; Computer industry; Computer networks; Costs; Disk drives; Image coding; Internet; Local area networks;
