|
|
 |
| Авторизация |
|
|
|
| Поиск по указателям |
|
|
|
|
|
|
|
 |
|
|
|
| van Lint J.H. — Coding Theory |
|
|
|
| Предметный указатель |
" " (Hamming codes) 25 41
" " (ternary) 85 96 102 115
" " matrix 17 40
" " symbol 3 17 22
 73
(n, k)-code 15 40
Affine permutation group 67
Average mutual information 9
Average self-information 9
BCH code 61
Block code 15
BSC, binary symmetric channel 4 13
Burst 71
Burst-error 3 71
Capacity 9 10
Carlitz — Uchiyama bound 127
Channel 1
CHARACTER 108
Check-polynomial 45
Code 4
Code, (n, k) 15 40
Code, BCH 61
Code, binary Golay 84 96 97 98 119
Code, block 15
Code, cyclic 42
Code, direct-product 36
Code, dual 17
Code, e-error-correcting 15
Code, Elias 40
Code, equivalent 16 48 90
Code, extended 22 80
Code, generalized RM 75
Code, group 15 88
Code, Hamming 20 21 22 30 47 86
Code, irreducible cyclic 45 56
Code, linear 15
Code, maximal cyclic 43
Code, optimal 72
Code, perfect 21 22 85 86
Code, primitive BCH 61
Code, quadratic residue 79 80
Code, Reed — Muller 27 29 78
Code, Reed — Solomon 70
Code, repetition 13 29 96
Code, systematic 17
Code, ternary Golay 85 96 102 115
Coset leader 18 19
Covering problem 92
Cyclic code 42
Decoding failure 22
Designed distance 61
Direct-product code 36
DMC, discrete memoryless channel 4
Dual code 17
Elias codes 40
entropy 9 13
Equivalent codes 16 48 90
erasure 2 13
Error 1
Error location 65
Error locator 65
Error pattern 6
| Error-correcting code 15
EXPONENT 44
Extended code 22 80
Field polynomial 56
Football-pool problem 22 92
Generalized RM codes 75
Generator matrix 16
Generator polynomial 43
Golay code (binary) 84 96 97 98 119
Group code 15 88
Group ring 105
Hamming code 20 21 22 30 47 86
Hamming distance 7
Idempotent 49 82
Idempotent, primitive 50 51
Information rate 5
Information symbol 17
Irreducible cyclic code 45 56
Kronecker product 38
Linear code 15
Linear functional 108
Linear recurring sequence 57
Lloyd's Theorem 104
Mathieu group 98
Mattson — Solomon polynomial 58
Maximal cyclic code 43
Maximum likelihood decoding 6 19
Minimal ideal 45
Minimum distance 15
Monomial group 106
Mutual information 8
Noise 1
Optimal codes 72
Orthogonal parity-check equations 33 36
Overall parity-check 22
Parity-check equation 17 33 36
Perfect code 21 22 85 86
Period 53
Primitive BCH code 61
Primitive idenrpotent 50 51
PSL (2, n) 83 98
Quadratic residue codes 79 80
Reduced echelon form 16
Redundancy 3
Reed — Muller codes 27 29 78
Reed — Solomon codes 70
Repetition codes 13 29 96
Self-information 9
Shannon's fundamental theorem 10 11
Sphere 7
Sphere-packing condition 92
Standard array 18
Steiner system 94
Syndrome 17 18
Systematic code 17
t-design 94
Tactical configuration 94
Threshold decoding 32
Trace 56
Vandermonde determinant 57
Weight 15
Weight enumerator 23 70 73 89 120 122
Word length 15
|
|
|
| Реклама |
|
|
|
|
|
О проекте