The uniformly packed binary \([27, 21, 3 ]\) and \([35, 29, 3 ]\) codes

DOI10.1016/0012-365X(95)00245-RzbMath0838.94014OpenAlexW2012205881MaRDI QIDQ1910585

Vladimir D. Tonchev

Publication date: 25 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00245-r

zbMATH Keywords

strongly regular graphsautomorphism groupsbinary projective two-weight codeslinear binary uniformly packed codes

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05) Graph theory (05C99)

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