A Course In Error-Correcting Codes
Tom Høholdt
Technical University of DenmarkJørn Justesen
Technical University of Denmark
A subscription is required to access this book.
| Front matterDownload pp. i–iv | |
| ContentsDownload pp. v–vii | |
| PrefaceDownload p. ix | |
| 1 | Block codes for error-correctionpp. 1–17 |
| 2 | Finite fieldspp. 19–31 |
| 3 | Bounds on error probability for error-correcting codespp. 33–40 |
| 4 | Communication channels and information theorypp. 41–47 |
| 5 | Reed-Solomon codes and their decodingpp. 49–62 |
| 6 | Cyclic Codespp. 63–72 |
| 7 | Framespp. 73–81 |
| 8 | Convolutional codespp. 83–96 |
| 9 | Maximum likelihood decoding of convolutional codespp. 97–107 |
| 10 | Combinations of several codespp. 109–117 |
| 11 | Decoding Reed-Solomon and BCH-codes with the Euclidian algorithmpp. 119–125 |
| 12 | List decoding of Reed-Solomon codespp. 127–135 |
| 13 | Iterative decodingpp. 137–149 |
| 14 | Algebraic geometry codespp. 151–157 |
| A | Communication channelspp. 159–162 |
| B | Solutions to selected problemspp. 163–183 |
| C | Table of minimal polynomialspp. 185–186 |
| Bibliographypp. 187–189 | |
| Indexpp. 191–194 |