On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18 (Q5939708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1626644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18 |
scientific article; zbMATH DE number 1626644 |
Statements
On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18 (English)
0 references
30 July 2001
0 references
The minimum weight of an even trace-self-dual additive code of length \(n\) over \(F_4\) is at most \(2[n/6]+2\); codes meeting this bound are called extremal. The enumeration of such codes is pushed here to \(n=10\), where the class number is found to be 19. Under the hypothesis that at least two minimal words have the same support, also length 14 is treated and for length 18 such a code turns out to be equivalent to the extremal linear hermitian-self-dual code.
0 references
additive code
0 references
self-dual code
0 references
extremal code
0 references
0 references
0.9287974
0 references
0.90208375
0 references
0.90158874
0 references
0.8955062
0 references
0.8872336
0 references
0.8872336
0 references
0.88703716
0 references
0.8863563
0 references
