The uniformly packed binary \([27, 21, 3 ]\) and \([35, 29, 3 ]\) codes
From MaRDI portal
Publication:1910585
DOI10.1016/0012-365X(95)00245-RzbMath0838.94014MaRDI QIDQ1910585
Publication date: 25 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
strongly regular graphs; automorphism groups; binary projective two-weight codes; linear binary uniformly packed codes
20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
94B05: Linear codes (general theory)
05C99: Graph theory
Related Items
Projective two-weight codes with small parameters and their corresponding graphs, On the binary projective codes with dimension 6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
- Quasi-symmetric designs, codes, quadrics, and hyperplane sections
- On the \([28,7,12\) binary self-complementary codes and their residuals]
- Weights of linear codes and strongly regular normed spaces
- The Geometry of Two-Weight Codes
- An updated table of minimum-distance bounds for binary linear codes