A strengthening of the Assmus-Mattson theorem

DOI10.1109/18.133244zbMath0734.94018OpenAlexW2067964515MaRDI QIDQ3363239

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 codeGolay codeextremal self-dual codet-designs

Mathematics Subject Classification ID

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

Related Items (8)

An upper bound of the value of \(t\) of the support \(t\)-designs of extremal binary doubly even self-dual codes ⋮ An Assmus-Mattson theorem for codes over commutative association schemes ⋮ The subconstituent algebra of an association scheme. I ⋮ On the support designs of extremal binary doubly even self-dual codes ⋮ Designs from subcode supports of linear codes ⋮ New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra ⋮ An Assmus--Mattson Theorem for Rank Metric Codes ⋮ Commutative association schemes

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