On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs

DOI10.1134/S0032946007010020zbMath1140.94376OpenAlexW2006862521MaRDI QIDQ926627

Iliya G. Bouyukliev, Stefka Bouyuklieva, Stefan Dodunekov

Publication date: 20 May 2008

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946007010020

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Uses Software

• Q-extension

Cites Work

• Unnamed Item
• Unnamed Item
• Projective two-weight codes with small parameters and their corresponding graphs
• Exponential numbers of two-weight codes, difference sets and symmetric designs
• Codes and projective multisets
• Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
• On the \([28,7,12\) binary self-complementary codes and their residuals]
• Designs with the symmetric difference property on 64 points and their groups
• Quasi-symmetric designs and codes meeting the Grey-Rankin bound
• On the minimal points of positive definite quadratic forms
• Correction to 'Some Bounds for Error-Correcting Codes'
• A method for constructing inequivalent self-dual codes with applications to length 56
• Automorphisms of codes with applications to extremal doubly even codes of length 48
• Codes of lengths 120 and 136 meeting the Grey-Rankin bound and quasi-symmetric designs
• The Closest Packing of Spherical Caps in n Dimensions