The nonexistence of ternary [231,6,153] codes (Q2713650)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The nonexistence of ternary [231,6,153] codes |
scientific article; zbMATH DE number 1602778
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The nonexistence of ternary [231,6,153] codes |
scientific article; zbMATH DE number 1602778 |
Statements
10 June 2001
0 references
ternary code
0 references
linear code
0 references
Griesmer bound
0 references
The nonexistence of ternary [231,6,153] codes (English)
0 references
There exists a ternary \([232,6,153]\) code, and, by Griesmer bound, there exists no ternary \([n,6,153]\) code for \(n \leq 230\). The author proves the non-existence of ternary \([231,6,153]\) codes. This is achieved by combination of known facts about weight polynomials with a table of ternary \([n,5,d]\) codes, \(d \leq 81\), where \(n\) is minimal with respect to \(d\).
0 references
