Binary codes and quasi-symmetric designs

DOI10.1016/0012-365X(90)90005-3zbMath0698.05016OpenAlexW2006682610MaRDI QIDQ912107

A. R. Calderbrank, Peter Frankl

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90005-3

zbMATH Keywords

binary codesquasi-symmetric designs

Mathematics Subject Classification ID

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

Related Items (6)

Quasi-symmetric designs and codes meeting the Grey-Rankin bound ⋮ Quasi-symmetric designs with the difference of block intersection numbers two ⋮ Parametric restrictions on quasi-symmetric designs ⋮ On quasi-symmetric designs ⋮ Quasi-symmetric designs and the Smith normal form ⋮ Conditions for the parameters of the block graph of quasi-symmetric designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The application of invariant theory to the existence of quasi-symmetric designs
• Geometric invariants for quasi-symmetric designs
• Regular 2-Graphs
• Strongly Regular Graphs Derived from Combinatorial Designs

This page was built for publication: Binary codes and quasi-symmetric designs