scientific article; zbMATH DE number 1049269

From MaRDI portal
Publication:4348478





The book deals with foundations of information theory and the most important compression techniques. In the introduction to further discussion the authors formulate and prove the basic theorems on information, entropy and the capacity of binary channels. They also give a brief overview of prefix-condition codes and describe the Kraft-McMillan inequality as well as optimal and quasi-optimal encoding schemes, like Huffman's and Fano's algorithms. Furtheron they analyse lossless compression methods obtained by using probability models to drive a coder. The authors discuss ordinary and higher-order arithmetic coding schemes, giving both encoding and decoding procedures, as well as calculating compression ratios. Next, the authors proceed to an analysis of adaptive -- Huffman and arithmetic methods describing the Knuth and Gallager methods, and interval and recency rank encoding. In the next part the authors describe dictionary methods, that utilise lists (dictionaries) of phrases and pointers used to replace source fragments. Special interest is put on adaptive dictionary methods, described by Ziv and Lempel. The last part of the book concentrates on different transform methods used for image compression. In all of these methods, contrary to the earlier lossless methods, the partial loss of information is allowed. The authors explain the principles of JPEG and modern wavelet-based compression methods.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348478)