Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes

DOI10.1137/S0895480198341766MaRDI QIDQ4490777zbMATH OpenOpenAlexFDO

Authors Gerald J. Janusz

Publication date 20 July 2000

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480198341766

zbMATH Keywords

extremal codeweight enumeratorAssmus-Mattson theoremdesignscovering polynomialdesign strengthoverlap polynomial

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05)

Recommendations

• Covering polynomials and projections of self-dual codes
• A strengthening of the Assmus-Mattson theorem
• The weight distribution of the self-dual \([128,64]\) polarity design code
• On designs and formally self-dual codes
• Local weight enumerators for binary self-dual codes

Cited in

(5)

• An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes
• Generalized MacWilliams identities and their applications to perfect binary codes
• A survey on spherical designs and algebraic combinatorics on spheres
• Covering polynomials and projections of self-dual codes
• Parametrization of self-dual codes by orthogonal matrices

This page was built for publication: Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes

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