Year: 2014
Type: article
Abstract: Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of $m$-tuple support enumerators. We prove a generalization of theorems of Britz and of Ray-Chaudhuri and Siap, which build on earlier work of Klø ve, Shiromoto, Wan, and others. We then give illustrations of these $m$-tuple weight enumerators.
DOI: 10.1137/120876356
Author: Nathan Kaplan
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
Award: G3423440455
OpenAlex ID: W1980508832