Logo

Essential Coding Theory by Venkatesan Guruswami, Atri Rudra, Madhu Sudan

Small book cover: Essential Coding Theory

Essential Coding Theory
by

Publisher: University at Buffalo
Number of pages: 266

Description:
Error-correcting codes (henceforth, just codes) are clever ways of representing data so that one can recover the original information even if parts of it are corrupted. The basic idea is to judiciously introduce redundancy so that the original information can be recovered even when parts of the (redundant) data have been corrupted.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Information Theory and CodingInformation Theory and Coding
by - University of Cambridge
The aims of this course are to introduce the principles and applications of information theory. The course will study how information is measured in terms of probability and entropy, and the relationships among conditional and joint entropies; etc.
(27272 views)
Book cover: Information Theory, Inference, and Learning AlgorithmsInformation Theory, Inference, and Learning Algorithms
by - Cambridge University Press
A textbook on information theory, Bayesian inference and learning algorithms, useful for undergraduates and postgraduates students, and as a reference for researchers. Essential reading for students of electrical engineering and computer science.
(34510 views)
Book cover: Information Theory, Excess Entropy and Statistical ComplexityInformation Theory, Excess Entropy and Statistical Complexity
by - College of the Atlantic
This e-book is a brief tutorial on information theory, excess entropy and statistical complexity. From the table of contents: Background in Information Theory; Entropy Density and Excess Entropy; Computational Mechanics.
(16559 views)
Book cover: Around Kolmogorov Complexity: Basic Notions and ResultsAround Kolmogorov Complexity: Basic Notions and Results
by - arXiv.org
Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.
(9105 views)