A new proof of the Assmus-Mattson theorem for non-binary codes (Q5929718)

From MaRDI portal
Revision as of 23:40, 4 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1586414
Language Label Description Also known as
English
A new proof of the Assmus-Mattson theorem for non-binary codes
scientific article; zbMATH DE number 1586414

    Statements

    A new proof of the Assmus-Mattson theorem for non-binary codes (English)
    0 references
    0 references
    31 October 2001
    0 references
    The Assmus-Mattson theorem for linear codes over an arbitrary finite field is proved here by a method which for binary codes had been used before by \textit{C. Bachoc} [Des. Codes Cryptography 18, 11-28 (1999; Zbl 0961.94012)].
    0 references
    weight enumerator
    0 references
    Assmus-Mattson theorem
    0 references
    linear codes
    0 references

    Identifiers