On binary linear codes supporting t-designs

DOI10.1109/18.945246MaRDI QIDQ4544668zbMATH OpenOpenAlexFDO

Authors Marc Lalaude-Labayle

Publication date 4 August 2002

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

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

zbMATH Keywords

shadow\(t\)-designcodesharmonic weight enumerator

Mathematics Subject Classification ID

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

Recommendations

• Linear codes from support designs of ternary cyclic codes
• Infinite Families of Linear Codes Supporting More t-Designs
• The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
• Designs from subcode supports of linear codes
• Linear codes and doubly transitive symmetric designs
• Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
• Some \(t\)-designs from BCH codes
• Linear Codes From Some 2-Designs
• Designs from linear codes
• Designs from linear codes

Cited in

(7)

• The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
• Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
• On the support \(t\)-designs of extremal Type III and IV codes
• Conformal designs based on vertex operator algebras
• Designs from subcode supports of linear codes
• Designs and self-dual codes with long shadows.
• New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra

This page was built for publication: On binary linear codes supporting t-designs

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