Quasi-symmetric designs and self-dual codes

DOI10.1016/S0195-6698(86)80018-XzbMath0643.05014MaRDI QIDQ1101455

Vladimir D. Tonchev

Publication date: 1986

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

designsself-orthogonal codesthree designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Related Items

On designs with intersection numbers 0 and 2, The characterization of binary constant weight codes meeting the bound of Fu and Shen, Strongly regular graphs with strongly regular decomposition, A characterization of designs related to dodecads in the Witt system S(5,8,24), The application of invariant theory to the existence of quasi-symmetric designs, Inequalities for quasisymmetric designs, Geometric invariants for quasi-symmetric designs, Maximal 2-distance sets containing the regular simplex, Parametric restrictions on quasi-symmetric designs, Cyclic quasi-symmetric designs and self-orthogonal codes of length 63, On quasi-symmetric designs, Quasi-symmetric designs and the Smith normal form, Non-symmetric 2-designs modulo 2, On a conjecture of jungnickel and tonchev for quasi‐symmetric designs, An Erdős-Ko-Rado theorem for regular intersecting families of octads, A characterization of designs related to the Witt system S(5,8,24), A construction of non self-orthogonal designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture
• On the enumeration of self-dual codes
• Unrestricted codes with the Golay parameters are unique
• On the BIB design having the minimum p-rank
• The children of the (32, 16) doubly even codes
• On the uniqueness of the Golay codes
• Strongly Regular Graphs Derived from Combinatorial Designs
• On the classification and enumeration of self-dual codes