On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18 (Q5939708)

From MaRDI portal
Revision as of 21:26, 21 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1626644
Language Label Description Also known as
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references