Comprehensively discusses the codes, not the compression algorithms (the latter are available in many books, but the codes themselves are normally mentioned in the literature just in passing)
Requires a minimum of mathematics, this book is geared toward the general educated reader, not toward specialists
Readers can find errata and auxiliary material on the author´s website regularly maintained and updated
Most data compression methods that are based on variable-length codes employ the Huffman or Golomb codes. However, there are a large number of less-known codes that have useful properties - such as those containing certain bit patterns, or which are robust - and these can be useful. This book brings this large set of codes to the attention of workers in the field and to students of computer science. The text comprehensively discusses the codes, not the compression algorithms - the latter are available in many books, but the codes themselves are normally mentioned in the literature just in passing. The author´s crystal clear style of writing and presentation, which has been familiar to readers for many years, now allows easy access to the topic. Readers are only required to have a general familiarity with computer methods and essentially an understanding of the representation of data in bits and files.
Basic Codes.- Advanced Codes.- Robust Codes.
"...the greatest contribution of this book is that it brings together and describes such a large number of codes in a succinct manner. ...this book introduces the reader to many lesser-known codes, and conveys an appreciation for the wide variety of codes that exists. ...the author focuses on the principles underlying the codes ...the author includes many diagrams and examples to explain how the algorithms work. In summary, this is a great book for someone new to coding, as well as for someone who just wants to catch up on some of the more contemporary codes."
(W. Hu, ACM Computing Reviews, January 2009)
Most data compression methods that are based on variable-length codes employ the Huffman or Golomb codes. However, there are a large number of less-known codes that have useful properties - such as those containing certain bit patterns, or which are robust - and these can be useful. This book brings this large set of codes to the attention of workers in the field and of students of computer science.
David Salomon's crystal clear style of writing and presentation, which has been familiar to readers for many years now allows easy access to the topic. Readers are only required to have a general familiarity with computer methods and essentially an understanding of the representation of data in bits and files.
Computer scientists, electrical engineers and students majoring in computer science or electrical engineering will find this volume an invaluable resource, as will those readers in various physical sciences and mathematics.
From the contents.- Codes, Fixed- and Variable-Length.- Prefix Codes.- VLCs, Entropy, and Redundancy.- Universal Codes.- The Kraft-MacMillan Inequality.- Tunstall Code.- Schalkwijk's Coding.- Tjalkens-Willems V-to-B Coding.- Phased-In Codes.- Redundancy Feedback (RF) Coding.- Recursive Phased-In codes.- Self-Delimiting Codes.- Huffman Coding.- VLCs for Integers.- Start-Step-Stop Codes.- Start/Stop Codes.- Elias Codes.- Levenstein Code.- Even Rodeh Code.- Punctured Elias Codes.- Other Prefix Codes.- Ternary Comma Code.- Location Based Encoding (LBE).- Stout Codes.- Yamamoto's Recursive Code.- VLCs and Search Trees.- Taboo Codes.- Wang's Flag Code.- Yamamoto Flag Code.- Number Bases.- Fibonacci Code.- Generalized Fibonacci Codes.- Goldbach Codes.- Additive Codes.- Golomb Code.- Rice Codes.- Subexponential Code.- Codes Ending with '1'.- Codes for Error Control.- The Free Distance.- Synchronous Prefix Codes.- Resynchronizing Huffman Codes.- Bidirectional Codes.- Symmetric Codes.- VLEC Codes.- Summary.
"...the greatest contribution of this book is that it brings together and describes such a large number of codes in a succinct manner. ...this book introduces the reader to many lesser-known codes, and conveys an appreciation for the wide variety of codes that exists. ...the author focuses on the principles underlying the codes ...the author includes many diagrams and examples to explain how the algorithms work. In summary, this is a great book for someone new to coding, as well as for someone who just wants to catch up on some of the more contemporary codes."
(W. Hu, ACM Computing Reviews, January 2009)
Inhaltsverzeichnis
From the contents.- Codes, Fixed- and Variable-Length.- Prefix Codes.- VLCs, Entropy, and Redundancy.- Universal Codes.- The Kraft-MacMillan Inequality.- Tunstall Code.- Schalkwijk's Coding.- Tjalkens-Willems V-to-B Coding.- Phased-In Codes.- Redundancy Feedback (RF) Coding.- Recursive Phased-In codes.- Self-Delimiting Codes.- Huffman Coding.- VLCs for Integers.- Start-Step-Stop Codes.- Start/Stop Codes.- Elias Codes.- Levenstein Code.- Even Rodeh Code.- Punctured Elias Codes.- Other Prefix Codes.- Ternary Comma Code.- Location Based Encoding (LBE).- Stout Codes.- Yamamoto's Recursive Code.- VLCs and Search Trees.- Taboo Codes.- Wang's Flag Code.- Yamamoto Flag Code.- Number Bases.- Fibonacci Code.- Generalized Fibonacci Codes.- Goldbach Codes.- Additive Codes.- Golomb Code.- Rice Codes.- Subexponential Code.- Codes Ending with '1'.- Codes for Error Control.- The Free Distance.- Synchronous Prefix Codes.- Resynchronizing Huffman Codes.- Bidirectional Codes.- Symmetric Codes.- VLEC Codes.- Summary.
Klappentext
Most data compression methods that are based on variable-length codes employ the Huffman or Golomb codes. However, there are a large number of less-known codes that have useful properties - such as those containing certain bit patterns, or which are robust - and these can be useful. This book brings this large set of codes to the attention of workers in the field and of students of computer science.
David Salomon¿s crystal clear style of writing and presentation, which has been familiar to readers for many years now allows easy access to the topic. Readers are only required to have a general familiarity with computer methods and essentially an understanding of the representation of data in bits and files.
Computer scientists, electrical engineers and students majoring in computer science or electrical engineering will find this volume an invaluable resource, as will those readers in various physical sciences and mathematics.
Most data compression methods that are based on variable-length codes employ the Huffman or Golomb codes. However, there are a large number of less-known codes that have useful properties - such as those containing certain bit patterns, or which are robust - and these can be useful. This book brings this large set of codes to the attention of workers in the field and to students of computer science. The text comprehensively discusses the codes, not the compression algorithms - the latter are available in many books, but the codes themselves are normally mentioned in the literature just in passing. The author's crystal clear style of writing and presentation, which has been familiar to readers for many years, now allows easy access to the topic. Readers are only required to have a general familiarity with computer methods and essentially an understanding of the representation of data in bits and files.
