Harmonic higher and extended weight enumerators
Abstract
In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight enumerators. Moreover, we present the harmonic generalization of Greene's Theorem for the higher (resp. extended) weight enumerators. As an application of this Greene's-type theorem, we provide the MacWilliams-type identity for harmonic higher weight enumerators of codes over finite fields. Finally, we use this new identity to give a new proof of the Assmus-Mattson Theorem for subcode supports of linear codes over finite fields using harmonic higher weight enumerators.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.