Cover image for Algebraic and stochastic coding theory
Title:
Algebraic and stochastic coding theory
Author:
Kythe, Dave K., author.
ISBN:
9781315216560

9781351823760

9781466505629
Physical Description:
1 online resource (xxiv, 488 pages)
Contents:
chapter 1 Historical Background -- chapter 2 Digital Arithmetic -- chapter 3 Linear Codes -- chapter 4 Hamming Codes -- chapter 5 Extended Hamming Codes -- chapter 6 Bounds in Coding Theory -- chapter 7 Golay Codes -- chapter 8 Galois Fields -- chapter 9 Matrix Codes -- chapter 10 Cyclic Codes -- chapter 11 BCH Codes -- chapter 12 Reed�Muller Codes -- chapter 13 Reed�Solomon Codes -- chapter 14 Belief Propagation -- chapter 15 LDPC Codes -- chapter 16 Special LDPC Codes -- chapter 17 Discrete Distributions -- chapter 18 Erasure Codes -- chapter 19 Luby Transform Codes -- chapter 20 Raptor Codes -- chapter A ASCII Table -- chapter B Some Useful Groups -- chapter C Tables in Finite Fields -- chapter D Discrete Fourier Transform -- chapter E Software Resources.
Abstract:
Preface The purpose of writing this book is primarily to make the subject of coding theory easy for the starting senior or graduate student who possesses a thorough understanding of digital arithmetic, Boolean and modern algebra, and probability theory. In fact, any reader with these basic prerequisites will find this book interesting and useful. The contents cover the technical topics as well as material of general interest. This book explains many important technical features that have permeated the scientific and social culture of our time. The book just does not stop there. It takes the advanced readers, who have a good understanding of probability theory, stochastic analysis, and distributions, to recent theoretical developments in coding theory and shows them the limitations that the current research on the subject still imposes. For example, there still exist the following unanswered questions: What kind of overhead factor can we expect for large and small values of coding blocks? Are the different types of recent codes equivalent or do they perform differently? How do the published distributions fare in producing good codes for finite number of blocks? Is there a significant random variation in code generation for the given probability distributions? In addition, there are patent issues which deal with more efficient hardware and the expectation of the current advancement on the internet and data storage. As one can see from the above description and the table of contents, the book does not deal with any aspect of cryptography as this subject justifies a separate book, although certain rules used in this book are still useful in cryptography. What are the key benefits of this book for the readers?-- Provided by publisher.
Added Author:
Electronic Access:
Click here to view.
Holds:
Copies:

Available:*

Library
Material Type
Item Barcode
Shelf Number
Status
Item Holds
Searching...
E-Book 542456-1001 QA268 .K98 2012
Searching...

On Order