The application of invariant theory to the existence of quasi-symmetric designs
From MaRDI portal
Publication:1107532
DOI10.1016/0097-3165(87)90062-8zbMath0653.05011OpenAlexW2099165495MaRDI QIDQ1107532
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(87)90062-8
Related Items (13)
Quasi-symmetric designs related to the triangular graph ⋮ On designs with intersection numbers 0 and 2 ⋮ Strongly regular graphs with strongly regular decomposition ⋮ Geometric invariants for quasi-symmetric designs ⋮ Quasi-symmetric designs with the difference of block intersection numbers two ⋮ Binary codes and quasi-symmetric designs ⋮ Quasi-symmetric designs with \(y = \lambda{}\) ⋮ Parametric restrictions on quasi-symmetric designs ⋮ On quasi-symmetric designs ⋮ Quasi-symmetric designs and the Smith normal form ⋮ Non-symmetric 2-designs modulo 2 ⋮ Some characterizations of quasi-symmetric designs with a spread ⋮ On the minors of an incidence matrix and Smith normal form
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-symmetric designs and self-dual codes
- Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture
- Weight enumerators of self-orthogonal codes
- Near-regularity conditions for designs
- A classification of self-orthogonal codes over GF(2)
- Nonexistence of a uniformly packed [70,58,5 code (Corresp.)]
- Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique
- Strongly Regular Graphs Derived from Combinatorial Designs
- Gleason's theorem on self-dual codes
- On the classification and enumeration of self-dual codes
This page was built for publication: The application of invariant theory to the existence of quasi-symmetric designs
