Characterization of certain minimal rank designs
From MaRDI portal
The authors obtain various results on designs. The main result is the proof that the all-ones vector is in the binary code of a symmetric design with \(v=2^{2m}\), \(k=2^{2m-1}- 2^{m-1}\), \(\lambda= 2^{2m-2}- 2^{m-1}\).
Recommendations
Cites work
- Contractions of self-orthogonal codes
- Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
- Exponential numbers of two-weight codes, difference sets and symmetric designs
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 51841 (Why is no real title available?)
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 874557 (Why is no real title available?)
- scientific article; zbMATH DE number 3293543 (Why is no real title available?)
- scientific article; zbMATH DE number 3407684 (Why is no real title available?)
- Linear codes and doubly transitive symmetric designs
- On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
- Power moment identities on weight distributions in error correcting codes
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound
- Quasi-symmetric designs, codes, quadrics, and hyperplane sections
- Symplectic groups, symmetric designs, and line ovals
- Transitive groups of collineations on certain designs
Cited in
(2)
This page was built for publication: Characterization of certain minimal rank designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268601)