Coding Theory

• Alphabet
• Anticode
• Barker Code
• BCH Code
• Bent Function
• Binary Code
• Boolean Function Nonlinearity
• Byzantine Generals Problem
• Check Digit
• Checksum
• Code
• Code Covering Radius
• Codeword
• Coding Theory
• Coil-in-the-Box Problem
• Constant-Weight Code
• Covering Code
• Cyclic Code
• Cyclic Redundancy Check
• Deep Hole
• Doubly Truncated Witt Graph
• Dual Code
• Efficient Dominating Set
• Encoding
• Error-Correcting Code
• Exact-Distance Hamming Graph
• Generator Matrix
• Golay Code
• Golomb-Welch Conjecture
• Gray Code
• Gray Map
• Griesmer Bound
• Griesmer Code
• Hadamard Matrix
• Hamming (7,4) Code
• Hamming Code
• Hamming Scheme
• Hamming Weight
• Hat Problem
• Huffman Coding
• Identifying Code
• ISBN
• Large Witt Graph
• Lee Metric
• Leonard Graph
• Letter
• Linear Code
• Maximum Distance Separable Code
• McEliece-Rodemich-Rumsey-Welch Bound
• MDS Conjecture
• Nearly Perfect Code
• Noise
• Octacode
• Parity Check Matrix
• Perfect Code
• Preparata Code
• Quasi-Perfect Code
• Reed-Muller Code
• Reed-Solomon Code
• Self-Dual Code
• Single-Track Gray Code
• Singleton Bound
• Syndrome Decoding Problem
• Two-Distance Code
• UPC
• Ward's Conjecture
• Weight Enumerator
• Witt Design