Quasi-symmetric designs and codes meeting the Grey-Rankin bound

DOI10.1006/jcta.1997.2765zbMath0873.05011OpenAlexW1967009268MaRDI QIDQ1356042

Gary McGuire

Publication date: 26 October 1997

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.2765

zbMATH Keywords

binary codesGrey-Rankin boundquasi-symmetric designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25)

Related Items (14)

Error-tolerant ZZW-construction ⋮ New classes of self-complementary codes and quasi-symmetric designs ⋮ The characterization of binary constant weight codes meeting the bound of Fu and Shen ⋮ New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices ⋮ Hadamard equiangular tight frames ⋮ Equiangular tight frames from group divisible designs ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ On binary self-complementary [120, 9, 56 codes having an automorphism of order 3 and associated SDP designs] ⋮ Construction of two- or three-weight binary linear codes from Vasil'ev codes ⋮ Remark on a result of Constantine ⋮ Pseudo quasi-3 designs and their applications to coding theory ⋮ Combinatorial \(t\)-designs from special functions ⋮ Characterization of certain minimal rank designs ⋮ On the error-detecting performance of some classes of block codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary codes and quasi-symmetric designs
• Exponential numbers of two-weight codes, difference sets and symmetric designs
• Geometric invariants for quasi-symmetric designs
• Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
• Symplectic groups, symmetric designs, and line ovals
• Quasi-symmetric designs, codes, quadrics, and hyperplane sections
• On the \([28,7,12\) binary self-complementary codes and their residuals]
• On quasi-symmetric 2-(28, 12, 11) and 2-(36, 16, 12) designs
• Transitive groups of collineations on certain designs
• On the minimal points of positive definite quadratic forms
• Correction to 'Some Bounds for Error-Correcting Codes'
• Four fundamental parameters of a code and their combinatorial significance
• Strongly Regular Graphs Derived from Combinatorial Designs

This page was built for publication: Quasi-symmetric designs and codes meeting the Grey-Rankin bound