Normal view MARC view ISBD view

Variable-length Codes for Data Compression.

By: Salomon, David.
Contributor(s): Salomon, David.
Material type: materialTypeLabelBookSeries: eBooks on Demand.Publisher: London : Springer London, 2014Copyright date: ©2007Description: 1 online resource (202 pages).Content type: text Media type: computer Carrier type: online resourceISBN: 9781846289590.Subject(s): Computers | Data compression (Computer science) | Electronic books. -- localAdditional physical formats: Print version:: Variable-length Codes for Data CompressionDDC classification: 005.746 Online resources: Click here to view this ebook.
Contents:
CONTENTS -- Preface -- Introduction -- 1 Basic Codes -- 1.1 Codes, Fixed- and Variable-Length -- 1.2 Prefix Codes -- 1.3 VLCs, Entropy, and Redundancy -- 1.4 Universal Codes -- 1.5 The Kraft-McMillan Inequality -- 1.6 Tunstall Code -- 1.7 Schalkwijk's Coding -- 1.8 Tjalkens-Willems V-to-B Coding -- 1.9 Phased-In Codes -- 1.10 Redundancy Feedback (RF) Coding -- 1.11 Recursive Phased-In Codes -- 1.12 Self-Delimiting Codes -- 1.13 Huffman Coding -- 2 Advanced Codes -- 2.1 VLCs for Integers -- 2.2 Start-Step-Stop Codes -- 2.3 Start/Stop Codes -- 2.4 Elias Codes -- 2.5 Levenstein Code -- 2.6 Even-Rodeh Code -- 2.7 Punctured Elias Codes -- 2.8 Other Prefix Codes -- 2.9 Ternary Comma Code -- 2.10 Location Based Encoding (LBE) -- 2.11 Stout Codes -- 2.12 Boldi-Vigna (ζ) Codes -- 2.13 Yamamoto's Recursive Code -- 2.14 VLCs and Search Trees -- 2.15 Taboo Codes -- 2.16 Wang's Flag Code -- 2.17 Yamamoto Flag Code -- 2.18 Number Bases -- 2.19 Fibonacci Code -- 2.20 Generalized Fibonacci Codes -- 2.21 Goldbach Codes -- 2.22 Additive Codes -- 2.23 Golomb Code -- 2.24 Rice Codes -- 2.25 Subexponential Code -- 2.26 Codes Ending with "1" -- 3 Robust Codes -- 3.1 Codes For Error Control -- 3.2 The Free Distance -- 3.3 Synchronous Prefix Codes -- 3.4 Resynchronizing Huffman Codes -- 3.5 Bidirectional Codes -- 3.6 Symmetric Codes -- 3.7 VLEC Codes -- Summary and Unification -- Bibliography -- Index.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number URL Status Date due Barcode
Electronic Book UT Tyler Online
Online
QA75.5-76.95 (Browse shelf) http://ebookcentral.proquest.com/lib/uttyler/detail.action?docID=373073 Available EBC373073

CONTENTS -- Preface -- Introduction -- 1 Basic Codes -- 1.1 Codes, Fixed- and Variable-Length -- 1.2 Prefix Codes -- 1.3 VLCs, Entropy, and Redundancy -- 1.4 Universal Codes -- 1.5 The Kraft-McMillan Inequality -- 1.6 Tunstall Code -- 1.7 Schalkwijk's Coding -- 1.8 Tjalkens-Willems V-to-B Coding -- 1.9 Phased-In Codes -- 1.10 Redundancy Feedback (RF) Coding -- 1.11 Recursive Phased-In Codes -- 1.12 Self-Delimiting Codes -- 1.13 Huffman Coding -- 2 Advanced Codes -- 2.1 VLCs for Integers -- 2.2 Start-Step-Stop Codes -- 2.3 Start/Stop Codes -- 2.4 Elias Codes -- 2.5 Levenstein Code -- 2.6 Even-Rodeh Code -- 2.7 Punctured Elias Codes -- 2.8 Other Prefix Codes -- 2.9 Ternary Comma Code -- 2.10 Location Based Encoding (LBE) -- 2.11 Stout Codes -- 2.12 Boldi-Vigna (ζ) Codes -- 2.13 Yamamoto's Recursive Code -- 2.14 VLCs and Search Trees -- 2.15 Taboo Codes -- 2.16 Wang's Flag Code -- 2.17 Yamamoto Flag Code -- 2.18 Number Bases -- 2.19 Fibonacci Code -- 2.20 Generalized Fibonacci Codes -- 2.21 Goldbach Codes -- 2.22 Additive Codes -- 2.23 Golomb Code -- 2.24 Rice Codes -- 2.25 Subexponential Code -- 2.26 Codes Ending with "1" -- 3 Robust Codes -- 3.1 Codes For Error Control -- 3.2 The Free Distance -- 3.3 Synchronous Prefix Codes -- 3.4 Resynchronizing Huffman Codes -- 3.5 Bidirectional Codes -- 3.6 Symmetric Codes -- 3.7 VLEC Codes -- Summary and Unification -- Bibliography -- Index.

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.

Description based on publisher supplied metadata and other sources.

There are no comments for this item.

Log in to your account to post a comment.