Information and communication theory, circuits Topic
Coding theory
Summary
Coding theory is the study of codes that detect and correct errors in data that is sent over a noisy channel or kept in storage. A block code of length n over a finite alphabet is a set of words of length n, and its minimum distance is the least number of positions in which two different codewords differ. A code with minimum distance d corrects every pattern of fewer than d/2 errors, and a good code has both a large distance and a high rate. The subject started from 1948 to 1950 with Shannon's channel coding theorem and with the codes of Hamming and Golay, and it grew to use algebra, combinatorics, algebraic geometry and probability. This topic collects the coding theory pages of math2. Its sub-areas are listed below, in reading order. Information theory, mathematical cryptography and the theory of computation have their own topics, and so do designs and finite geometries.
Remarks
Sub-areas
- Foundations of coding theory
- Linear codes
- Weight enumerators and the MacWilliams identities
- Bounds on codes
- Perfect codes and MDS codes
- Hamming, simplex, Hadamard and Golay codes
- Cyclic codes
- BCH, Reed-Solomon and Goppa codes
- Reed-Muller codes
- Self-dual codes and invariant theory
- Codes over rings
- Algebraic geometry codes
- Concatenated, expander and asymptotically good codes
- Decoding methods and complexity
- List decoding
- Convolutional codes and trellis decoding
- Codes on graphs and iterative decoding
- Polar codes
- Erasure, fountain and distributed storage codes
- Locally decodable and locally testable codes
- Quantum error-correcting codes
- Codes for bursts, deletions and other error models
- Rank-metric and subspace codes
- Covering codes and the covering radius
- Geometric and structural theory of linear codes
Everything in this topic
The members of this topic and each page that they need, 25 pages in all.
Show the path as a graph
- no evidence level
- Algebraic geometry codes topic member
- BCH, Reed-Solomon and Goppa codes topic member
- Bounds on codes topic member
- Codes for bursts, deletions and other error models topic member
- Codes on graphs and iterative decoding topic member
- Codes over rings topic member
- Concatenated, expander and asymptotically good codes topic member
- Convolutional codes and trellis decoding topic member
- Covering codes and the covering radius topic member
- Cyclic codes topic member
- Decoding methods and complexity topic member
- Erasure, fountain and distributed storage codes topic member
- Foundations of coding theory topic member
- Geometric and structural theory of linear codes topic member
- Hamming, simplex, Hadamard and Golay codes topic member
- Linear codes topic member
- List decoding topic member
- Locally decodable and locally testable codes topic member
- Perfect codes and MDS codes topic member
- Polar codes topic member
- Quantum error-correcting codes topic member
- Rank-metric and subspace codes topic member
- Reed-Muller codes topic member
- Self-dual codes and invariant theory topic member
- Weight enumerators and the MacWilliams identities topic member
About this page
| Tag | J343A6XM3Y |
|---|---|
| URI | m2://J343A6XM3Y |
| Kind | topic |
| Writing | W0 stub |
| MSC | 94Bxx |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
Nodes in this topic
- Polar codes
- Cyclic codes
- Reed-Muller codes
- BCH, Reed-Solomon and Goppa codes
- Codes over rings
- Bounds on codes
- Weight enumerators and the MacWilliams identities
- Geometric and structural theory of linear codes
- Concatenated, expander and asymptotically good codes
- Foundations of coding theory
- Algebraic geometry codes
- Codes on graphs and iterative decoding
- Decoding methods and complexity
- Self-dual codes and invariant theory
- Erasure, fountain and distributed storage codes
- Perfect codes and MDS codes
- Locally decodable and locally testable codes
- Covering codes and the covering radius
- List decoding
- Quantum error-correcting codes
- Convolutional codes and trellis decoding
- Codes for bursts, deletions and other error models
- Hamming, simplex, Hadamard and Golay codes
- Linear codes
- Rank-metric and subspace codes