Compression and Coding Algorithms

By: Alistair Moffat, Andrew Turpin

Write A Review

eText | 6 December 2012

At a Glance

Format
PDF

eText

$84.99

or 4 interest-free payments of $21.25 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.