Ternary covering codes derived from BCH codes (Q1374190): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Patric R. J. Östergård / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Egon Schulte / rank | |||
Normal rank |
Revision as of 13:11, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ternary covering codes derived from BCH codes |
scientific article |
Statements
Ternary covering codes derived from BCH codes (English)
0 references
5 January 1998
0 references
The covering radius \(R\) of a code \(C\subset \mathbb F^n_q\) is the smallest integer such that every element in \(\mathbb F^n_q\) is within Hamming distance \(R\) of some codeword in \(C\). The authors construct new ternary linear codes with covering radius 2 by lengthening ternary BCH codes. The first code in this series is the ternary Golay code. It is also shown how this construction of the Golay code can be used to obtain short proofs of the best known upper bounds for the football pool problem for 11 or 12 matches. The football pool problem for \(n\) matches is the problem of determining the minimum cardinality of a ternary code of length \(n\) and covering radius 1.
0 references
covering radius
0 references
ternary linear codes
0 references
BCH codes
0 references
ternary Golay code
0 references
football pool problem
0 references