Ternary covering codes derived from BCH codes (Q1374190): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Patric R. J. Östergård / rank | |||
Property / reviewed by | |||
Property / reviewed by: Egon Schulte / rank | |||
Property / author | |||
Property / author: Patric R. J. Östergård / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Egon Schulte / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jcta.1997.2825 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2164691592 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: More coverings by rook domains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4342497 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructions and families of covering codes and saturated sets of points in projective geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3838685 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5638345 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New upper bounds for the football pool problem for 6, 7, and 8 matches / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New upper bounds for the football pool problem for 11 and 12 matches / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4222145 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:22, 27 May 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
0 references