Abstract
We present generalisations of several MacWilliams type identities, including those by Kløve and Shiromoto, and of the theorems of Greene and Barg that describe how the Tutte polynomial of the vector matroid of a linear code determines the rth support weight enumerators of the code. One of our main tools is a generalisation of a decomposition theorem due to Brylawski.
Cite
CITATION STYLE
APA
Britz, T. (2002). MacWilliams identities and matroid polynomials. Electronic Journal of Combinatorics, 9(1 R), 1–16. https://doi.org/10.37236/1636
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free