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

DOI10.1137/S0895480198341766zbMath0997.94022OpenAlexW2025456883MaRDI QIDQ4490777

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

Assmus-Mattson theoremweight enumeratordesignsextremal codecovering polynomialdesign strengthoverlap polynomial

Mathematics Subject Classification ID

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

Related Items (5)

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

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