A strengthening of the Assmus-Mattson theorem

DOI10.1109/18.133244zbMATH Open0734.94018OpenAlexW2067964515MaRDI QIDQ3363239FDOQ3363239

Authors Robert Calderbank, N. J. A. Sloane, Philippe Delsarte

Publication date 1991

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.133244

zbMATH Keywords

Assmus-Mattson theoremextremal self-dual codeGolay codebinary linear codet-designs

Mathematics Subject Classification ID

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

Recommendations

• A note on Assmus-Mattson type theorems
• A strengthening of Kikustapos;s theorem
• A strengthening of a theorem of Marcinkiewicz
• A strengthening of the Čech-Pospišil theorem
• A strengthening of a theorem of Bourgain and Kontorovich
• Strengthening a Theorem of Meyniel
• A strengthening of Brooks' theorem
• A strengthening the one of a theorem of Bourgain-Kontorovich
• scientific article; zbMATH DE number 3994518
• A Strong Generalization of Helgason's Theorem

Cited in

(23)

• A coding theoretic approach to extending designs
• A note on Assmus-Mattson type theorems
• A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator
• An Assmus-Mattson theorem for codes over commutative association schemes
• scientific article; zbMATH DE number 4037768 (Why is no real title available?)
• New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
• An Assmus-Mattson theorem for rank metric codes
• A note on the Assmus-Mattson theorem for some binary codes. II
• Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes
• Über die Wurzelschranke für das Minimalgewicht von Codes
• Designs from matroids
• On the support designs of extremal binary doubly even self-dual codes
• The subconstituent algebra of an association scheme. I
• Designs in additive codes over GF(4)
• Designs from subcode supports of linear codes
• Commutative association schemes
• A new proof of the Assmus-Mattson theorem for non-binary codes
• A note on the Assmus-Mattson theorem for some binary codes
• On the Assmus--Mattson type theorem for Type I and even formally self-dual codes
• An upper bound of the value of \(t\) of the support \(t\)-designs of extremal binary doubly even self-dual codes
• On intersection properties of extremal ternary codes
• On self-dual doubly-even extremal codes
• Weighted subspace designs from \(q\)-polymatroids

This page was built for publication: A strengthening of the Assmus-Mattson theorem

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