MacWilliams identities and matroid polynomials

zbMATH Open1038.05008MaRDI QIDQ1348850FDOQ1348850

Thomas Britz

Publication date: 3 June 2002

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/123544

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

weight enumeratorlinear code

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Linear codes (general theory) (94B05)

Cited In (8)

• Linear codes over signed graphs
• Demi-matroids from codes over finite Frobenius rings
• Parity check systems of nonlinear codes over finite commutative Frobenius rings
• Generalized MacWilliams identities and their applications to perfect binary codes
• Extensions of the critical theorem
• Higher support matroids
• Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
• A MacWilliams type identity for matroids

This page was built for publication: MacWilliams identities and matroid polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348850)