A strengthening of the Assmus-Mattson theorem

DOI10.1109/18.133244MaRDI QIDQ3363239zbMATH OpenOpenAlexFDO

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 theorembinary linear codeextremal self-dual codeGolay 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

(24)

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

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)