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.
This book introduces the reader to the theoretical foundations of error-correcting codes, with an emphasis on Reed-Solomon codes and their derivative codes. After reviewing linear codes and finite fields, it describes Reed-Solomon codes and various decoding algorithms. Cyclic codes are presented, as are MDS codes, graph codes, and codes in the Lee metric. Concatenated, trellis, and convolutional codes are also discussed in detail.
| Pages : | 256 pages |
| Size : | PDF (391 pages) |
| Downloads: | 16 |
| Created: | 2020-08-29 |
| License: | CC BY-NC-ND 3.0 |
| Author(s): | Venkatesan Guruswami, Atri Rudra, Madhu Sudan |