Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
error-correcting code
|
| gptkbp:alphabet |
binary
|
| gptkbp:automorphismGroup |
large
|
| gptkbp:discoveredIn |
1972
|
| gptkbp:distance |
2^{m-1}
|
| gptkbp:field |
coding theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kerdock code
|
| gptkbp:isAdditive |
yes
|
| gptkbp:isMatrixGroup |
no
|
| gptkbp:length |
2^m
|
| gptkbp:namedAfter |
Andrew M. Kerdock
|
| gptkbp:notableFor |
can be described using quadratic forms
meets the sphere-packing bound for binary codes nonlinear but has large minimum distance |
| gptkbp:relatedTo |
gptkb:Reed–Muller_code
Preparata code |
| gptkbp:usedIn |
communications
data storage |
| gptkbp:bfsParent |
gptkb:Delsarte–Goethals_code
|
| gptkbp:bfsLayer |
8
|