Variable-length Codes for Data Compression free download online
Title: Variable-length Codes for Data Compression Author(s): David Salomon Pages: 196 Publisher: Springer; 1 edition Publication date: 2007 Language: English Format: PDF ISBN-10: 1846289580 ISBN-13: Description: 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 those that 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.
David Salomons clear style of writing and presentation, which has been familiar to readers for many years now, allows easy access to this topic. This comprehensive text offers readers a detailed, reader-friendly description of the variable length codes used in the field of data compression. 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.
Topics and Features:
Discusses codes in-depth, not the compression algorithms, which are readily available in many books
Includes detailed illustrations, providing readers with a deeper and broader understanding of the topic
Provides a supplementary author-maintained website, with errata and auxiliary material www.davidsalomon.name/VLCadvertis/VLC.html
Easily understood and used by computer science majors requiring only a minimum of mathematics
Can easily be used as a main or auxiliary textbook for courses on algebraic codes or data compression and protection
An ideal companion volume to David Salomons fourth edition of Data Compression: The Complete Reference
Computer scientists, electrical engineers and students majoring in computer science or electrical engineering will find this volume a valuable resource, as will those readers in various physical sciences and mathematics.
David Salomon is a professor emeritus of Computer Science at California State University, Northridge. He has authored numerous articles and books, including Coding for Data and Computer Communications, Guide to Data Compression Methods, Data Privacy and Security, Computer Graphics and Geometric Modeling, Foundations of Computer Security, and Transformations and Projections in Computer Graphics.
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
Variable-length Codes for Data Compression free download links:
Title: Variable-length Codes for Data Compression