Compression And Coding Algorithms

Compression and Coding Algorithms describes in detail the coding mechanisms that are available for use in data compression systems. The well known Huffman coding technique is one mechanism, but there have been many others developed over the past few decades, and this book describes, explains and assesses them. People undertaking research of software development in the areas of compression and coding algorithms will find this book an indispensable reference. In particular, the careful and detailed description of algorithms and their implementation, plus accompanying pseudo-code that can be readily implemented on computer, make this book a definitive reference in an area currently without one.

An authoritative reference to the whole area of source coding algorithms, Compression and Coding Algorithms will be a primary resource for both researchers and software engineers. The book also will be interest for people in broader area of design and analysis of algorithms and data structure. Practitioners, especially those who work in the software development and independent consulting industries creating compression software or other applications systems, in which compression plays a part, will benefit from techniques that are described.
Compression and Coding Algorithms describes in detail the coding mechanisms that are available for use in data compression systems. The well known Huffman coding technique is one mechanism, but there have been many others developed over the past few decades, and this book describes, explains and assesses them. People undertaking research of software development in the areas of compression and coding algorithms will find this book an indispensable reference. In particular, the careful and detailed description of algorithms and their implementation, plus accompanying pseudo-code that can be readily implemented on computer, make this book a definitive reference in an area currently without one.
The detailed pseudo-code presentation of over thirty algorithms, and careful explanation of examples, make this book approachable and authoritative. Compression and throughput results are presented where appropriate, and serve as a validation of the assessments and recommendation made in the text. The combination of implementation detail, thoughtful discussions, and careful presentation means that this book will occupy a pivotal role in this area for many years. In-depth coverage of the crucial areas of minimum-redundancy coding, arithmetic coding, adaptive coding make Compression and Coding Algorithms unique in its field.

Booknews

Moffat (U. of Melbourne) and Turpin (Curtin U. of Technology, Australia) examine a wide range of mechanisms that have been proposed for coding in data compression systems, covering some fifty years of methods and algorithms. The text emphasizes the practicalities of implementation and execution. It includes descriptions of recent improvements to widely-known methods, such as minimum-redundancy (Huffman) coding and arithmetic coding, and coding problems with additional constraints, such as length-limited, alphabetic, and unequal letter-cost coding. Also discussed are three state-of-the-art compression systems, including descriptions of the type of coders employed and the reasons for that choice. For graduate and advanced graduate students, researchers, and software engineers. Annotation c. Book News, Inc., Portland, OR (booknews.com)