Category:Coding theory
![]() | Computing portal |
Here is a list of articles in the Coding theory category of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has the following 4 subcategories, out of 4 total.
C
D
E
Pages in category "Coding theory"
The following 121 pages are in this category, out of 121 total.
- Coding theory (computing)
- List of algebraic coding theory topics (computing)
1
- 1st Johnson bound (computing)
2
- 2nd Johnson bound (computing)
A
- Alternant code (computing)
- Arbitrarily varying channel (computing)
B
- Bar product (computing)
- BCH code (computing)
- Belief propagation (computing)
- Berger code (computing)
- Berlekamp switching game (computing)
- Berlekamp–Welch algorithm (computing)
- Binary erasure channel (computing)
- Binary Goppa code (computing)
- Binary symmetric channel (computing)
- Blackwell channel (computing)
- Blahut–Arimoto algorithm (computing)
- Block code (computing)
- Burst error-correcting code (computing)
C
- Canonical Huffman code (computing)
- Coding gain (computing)
- Comma code (computing)
- Comma-free code (computing)
- Computationally bounded adversary (computing)
- Concatenated error correction code (computing)
- Convolutional Sparse Coding (computing)
- Coset leader (computing)
- Covering code (computing)
- Cyclic code (computing)
D
- Decoding methods (computing)
- Deletion channel (computing)
- Delsarte–Goethals code (computing)
- Distributed source coding (computing)
- Dual code (computing)
E
- Enumerator polynomial (computing)
- Erasure code (computing)
- Even code (computing)
- Expander code (computing)
F
- Factorization of polynomials over finite fields (computing)
- First Johnson bound (computing)
- Folded Reed–Solomon code (computing)
- Forney algorithm (computing)
- Fountain code (computing)
- Fuzzy extractor (computing)
G
- Generalized minimum-distance decoding (computing)
- Generator matrix (computing)
- Gibbs' inequality (computing)
- Gilbert–Varshamov bound (computing)
- Gilbert–Varshamov bound for linear codes (computing)
- Goppa code (computing)
- Grammar-based code (computing)
- Gray isometry (computing)
- Griesmer bound (computing)
- Group code (computing)
- Guruswami–Sudan list decoding algorithm (computing)
- GV-linear-code (computing)
H
- Hadamard code (computing)
- Hamming bound (computing)
- Hamming code (computing)
- Hamming distance (computing)
- Hamming scheme (computing)
- Hamming space (computing)
- Hamming weight (computing)
- Hamming(7,4) (computing)
- Hexacode (computing)
- Homomorphic signatures for network coding (computing)
J
- Johnson bound (computing)
- Justesen code (computing)
K
- Kraft–McMillan inequality (computing)
L
- Lee distance (computing)
- Line code (computing)
- Linear code (computing)
- List decoding (computing)
- Long code (mathematics) (computing)
- Low-density parity-check code (computing)
- Luby transform code (computing)
M
- Minimum weight (computing)
- Multiple description coding (computing)
N
- Linear network coding (computing)
- Noisy text (computing)
- Noisy-channel coding theorem (computing)
- Non-integer base of numeration (computing)
O
- Online codes (computing)
P
- Package-merge algorithm (computing)
- Packet erasure channel (computing)
- Parity-check matrix (computing)
- Parvaresh–Vardy code (computing)
- Plotkin bound (computing)
- Polar code (coding theory) (computing)
- Polynomial code (computing)
- Prefix code (computing)
- Preparata code (computing)
- Puncturing (computing)
Q
- Quadratic residue code (computing)
R
- Rank error-correcting code (computing)
- Raptor code (computing)
- Recursive indexing (computing)
- Reed–Muller code (computing)
- Reed–Solomon error correction (computing)
- Repetition code (computing)
S
- Sardinas–Patterson algorithm (computing)
- Second Johnson bound (computing)
- Shannon's source coding theorem (computing)
- Signed-digit representation (computing)
- Singleton bound (computing)
- Soliton distribution (computing)
- Spherical code (computing)
- Srivastava code (computing)
- Standard array (computing)
- Systematic code (computing)
T
- Tanner graph (computing)
- Ternary Golay code (computing)
- Tornado code (computing)
- Triangular network coding (computing)
U
- Unary coding (computing)
- Unary numeral system (computing)
V
- Variable-length code (computing)
Z
- Z-channel (information theory) (computing)
- Zemor's decoding algorithm (computing)
- Zigzag code (computing)
- Zyablov bound (computing)