| Preface | p. vii |
| Basics on error control | p. 1 |
| ABC on codes | p. 1 |
| Basic notations and terminology | p. 1 |
| Hamming weight and distance | p. 2 |
| Support of a set of vectors | p. 2 |
| Extending vectors | p. 3 |
| Ordering | p. 3 |
| Entropy | p. 3 |
| Systematic codes | p. 3 |
| Equivalent codes | p. 4 |
| New codes from old | p. 4 |
| Cyclic codes | p. 5 |
| Linear codes | p. 6 |
| Generator and check matrices for linear codes | p. 6 |
| The simplex codes and the Hamming codes | p. 6 |
| Equivalent and systematic linear codes | p. 7 |
| New linear codes from old | p. 7 |
| Cyclic linear and shortened cyclic linear codes | p. 10 |
| Distance distribution of codes | p. 13 |
| Definition of distance distribution | p. 13 |
| The MacWilliams transform | p. 13 |
| Binomial moment | p. 16 |
| Distance distribution of complementary codes | p. 20 |
| Weight distribution of linear codes | p. 22 |
| Weight distribution | p. 22 |
| Weight distribution of *-extended codes | p. 23 |
| MacWilliams's theorem | p. 23 |
| A generalized weight distribution | p. 24 |
| Linear codes over larger fields | p. 24 |
| Weight distribution of cosets | p. 25 |
| Counting vectors in a sphere | p. 27 |
| Bounds on the number of code words of a given weight | p. 29 |
| The weight hierarchy | p. 30 |
| Principles of error detection | p. 30 |
| Pure detection | p. 30 |
| Combined correction and detection | p. 31 |
| Comments and references | p. 32 |
| Error detecting codes for the q-ary symmetric channel | p. 35 |
| Basic formulas and bounds | p. 35 |
| The q-ary symmetric channel | p. 35 |
| Probability of undetected error | p. 35 |
| The threshold | p. 42 |
| Alternative expressions for the probability of undetected error | p. 44 |
| Relations to coset weight distributions | p. 45 |
| P[subscript ue] for a code and its MacWilliams transform | p. 45 |
| Conditions for a code to be satisfactory, good, or proper | p. 47 |
| How to determine if a polynomial has a zero | p. 47 |
| Sufficient conditions for a code to be good | p. 49 |
| Necessary conditions for a code to be good or satisfactory | p. 49 |
| Sufficient conditions for a code to be proper | p. 57 |
| Large codes are proper | p. 60 |
| Results on the average probability | p. 66 |
| General results on the average | p. 66 |
| The variance | p. 67 |
| Average for special classes of codes | p. 68 |
| Average for systematic codes | p. 72 |
| The worst-case error probability | p. 79 |
| General bounds | p. 84 |
| Lower bounds | p. 84 |
| Upper bounds | p. 89 |
| Asymptotic bounds | p. 95 |
| Optimal codes | p. 97 |
| The dual of an optimal code | p. 97 |
| Copies of the simplex code | p. 97 |
| New codes from old | p. 97 |
| The *-operation | p. 98 |
| Shortened codes | p. 101 |
| Product codes | p. 102 |
| Repeated codes | p. 102 |
| Probability of having received the correct code word | p. 103 |
| Combined correction and detection | p. 105 |
| Using a single code for correction and detection | p. 105 |
| Concatenated codes for error correction and detection | p. 108 |
| Probability of having received the correct code word after decoding | p. 109 |
| Complexity of computing P[subscript ue](C,p) | p. 109 |
| Particular codes | p. 110 |
| Perfect codes | p. 110 |
| MDS and related codes | p. 112 |
| Cyclic codes | p. 114 |
| Two weight irreducible cyclic codes | p. 115 |
| The product of two single parity check codes | p. 116 |
| How to find the code you need | p. 116 |
| The local symmetric channel | p. 118 |
| Comments and references | p. 124 |
| Error detecting codes for the binary symmetric channel | p. 129 |
| A condition that implies "good" | p. 129 |
| Binary optimal codes for small dimensions | p. 132 |
| Modified codes | p. 136 |
| Adding/removing a parity bit | p. 136 |
| Even-weight subcodes | p. 137 |
| Binary cyclic redundancy check (CRC) codes | p. 137 |
| Particular codes | p. 140 |
| Reed-Muller codes | p. 140 |
| Binary BCH codes | p. 143 |
| Z[subscript 4]-linear codes | p. 144 |
| Self-complementary codes | p. 147 |
| Self-dual codes | p. 148 |
| Binary constant weight codes | p. 149 |
| The codes [Characters not reproducible] | p. 149 |
| An upper bound | p. 151 |
| Lower bounds | p. 151 |
| Comments and references | p. 152 |
| Error detecting codes for asymmetric and other channels | p. 153 |
| Asymmetric channels | p. 153 |
| The Z-channel | p. 153 |
| Codes for the q-ary asymmetric channel | p. 156 |
| Diversity combining on the Z-channel | p. 159 |
| Coding for a symmetric channel with unknown characteristic | p. 162 |
| Bounds | p. 163 |
| Constructions | p. 164 |
| Codes for detection of substitution errors and transpositions | p. 165 |
| ST codes | p. 165 |
| ISBN | p. 170 |
| IBM code | p. 171 |
| Digital codes with two check digits | p. 172 |
| Barcodes | p. 173 |
| Error detection for runlength-limited codes | p. 175 |
| Comments and references | p. 178 |
| Bibliography | p. 181 |
| Index | p. 199 |
| Table of Contents provided by Ingram. All Rights Reserved. |
