## Abstract An updated table of __K__~2,3~(__b__,__t__;__R__)—the minimum cardinality of a code with __b__ binary coordinates, __t__ ternary coordinates, and covering radius __R__—is presented for __b__ + __t__ ≤ 13, __R__ ≤ 3. The results include new explanations of short binary and ternary coveri
Ternary Covering Codes Derived from BCH Codes
✍ Scribed by John C Cock; Patric R.J Östergård
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 250 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
✦ Synopsis
It is shown how ternary BCH codes can be lengthened to get linear codes with covering radius 2. The family obtained has the ternary Golay code as its first code, contains codes with record-breaking parameters, and has a good asymptotic behavior. The ternary Golay code is further used to obtain short proofs for the best known upper bounds for the football pool problem for 11 and 12 matches.
📜 SIMILAR VOLUMES
The minimum weight codewords in the Preparata code of length n = 4" are utilized for the construction of an infinite family of Steiner S(4, {5,6}, 4"l + 1) designs for any rn 2 2. 0 1996 John Wiley & Sons, Inc. A t-wise balanced design with parameters t -(w, Ic, A) is a pair (X, 0) where X is a set
## Abstract The article gives constructions of disjoint 5‐designs obtained from permutation groups and extremal self‐dual codes. Several new simple 5‐designs are found with parameters that were left open in the table of 5‐designs given in (G. B. Khosrovshahi and R. Laue, __t__‐Designs with __t__⩾3,