Characterization of certain minimal rank designs

DOI10.1006/jcta.1997.2856zbMath0913.05011OpenAlexW2090896737MaRDI QIDQ1268601

Gary McGuire, Harold N. Ward

Publication date: 10 June 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2856

zbMATH Keywords

symmetric designbinary code

Mathematics Subject Classification ID

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

Related Items (2)

The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes ⋮ Characterization of SDP designs that yield certain spin models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential numbers of two-weight codes, difference sets and symmetric designs
• Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
• On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
• Symplectic groups, symmetric designs, and line ovals
• Contractions of self-orthogonal codes
• Quasi-symmetric designs, codes, quadrics, and hyperplane sections
• Quasi-symmetric designs and codes meeting the Grey-Rankin bound
• Linear codes and doubly transitive symmetric designs
• Transitive groups of collineations on certain designs
• Power moment identities on weight distributions in error correcting codes

This page was built for publication: Characterization of certain minimal rank designs