Through information theory, problems of communication and
compression can be precisely modeled, formulated, and analyzed, and
this information can be transformed by means of algorithms. Also,
learning can be viewed as compression with side information. Aimed
at students and researchers, this book addresses data compression
and redundancy within existing methods and central topics in
theoretical data compression, demonstrating how to use tools from
analytic combinatorics to discover and analyze precise behavior of
source codes. It shows that to present better learnable or
extractable information in its shortest description, one must
understand what the information is, and then algorithmically
extract it in its most compact form via an efficient compression
algorithm. Part I covers fixed-to-variable codes such as Shannon
and Huffman codes, variable-to-fixed codes such as Tunstall and
Khodak codes, and variable-to-variable Khodak codes for known
sources. Part II discusses universal source coding for memoryless,
Markov, and renewal sources.
General
Imprint: |
Cambridge UniversityPress
|
Country of origin: |
United Kingdom |
Release date: |
September 2023 |
Authors: |
Michael Drmota
• Wojciech Szpankowski
|
Pages: |
400 |
ISBN-13: |
978-1-108-47444-3 |
Categories: |
Books
|
LSN: |
1-108-47444-6 |
Barcode: |
9781108474443 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!