Some new optimal ternary linear codes (Q1364206)
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: Some new optimal ternary linear codes |
scientific article; zbMATH DE number 1051426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some new optimal ternary linear codes |
scientific article; zbMATH DE number 1051426 |
Statements
Some new optimal ternary linear codes (English)
0 references
25 August 1997
0 references
The maximum possible minimum Hamming distance of a ternary \([n,k,d;3]\)-code is determined for many values of \(n\) and \(k\). These results are obtained by a descent method for designing good linear codes.
0 references
optimal ternary linear codes
0 references
Hamming distance
0 references
