| 1 |
Block Codes |
|
| 2 |
Linear Codes |
|
| 3 |
Parity Checks and Dual Code |
|
| 4 |
Decoding and the Error Probability |
|
| 5 |
Equivalent Codes |
|
| 6 |
Code Constructions |
|
| 7 |
Bounds on Codes |
|
| 8 |
Asymptotic Bounds |
|
| 9 |
Weight Enumerator |
|
| 10 |
Extended Weight Enumerator |
|
| 11 |
Generalized Weight Enumerator |
|
| 12 |
Error Probability |
|
| 13 |
Cyclic Codes |
|
| 14 |
Finite Fields |
|
| 15 |
Defining Zeros |
|
| 16 |
Bounds on the Minimum Distance |
|
| 17 |
Improvements of the BCH Bound |
|
| 18 |
Locator Polynomials and Decoding Cyclic Codes |
|
| 19 |
RS Codes and their Generalizations |
|
| 20 |
Subfield Subcodes and Trace Codes |
|
| 21 |
Some Families of Polynomial Codes |
|
| 22 |
Reed–Muller Codes |
|
| 23 |
Decoding by Key Equation |
|
| 24 |
Error-correcting Pairs |
|
| 25 |
List Decoding by Sudan’s Algorithm |
|
| 26 |
Complexity |
|
| 27 |
Decoding Complexity |
|
| 28 |
Difficult Problems in Coding Theory |
|
| 29 |
Graphs and Codes |
|
| 30 |
Matroids and Codes |
|
| 31 |
Finite Geometry and Codes |
|
| 32 |
Characteristic Polynomial |
|