On the \([28,7,12]\) binary self-complementary codes and their residuals

DOI10.1007/BF01388560zbMath0806.94025OpenAlexW2081412462MaRDI QIDQ1321558

Sylvia B. Encheva, Stoian N. Kapralov, Stefan Dodunekov

Publication date: 28 April 1994

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01388560

zbMATH Keywords

binary linear self-complementary codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Combinatorial structures in finite projective spaces (51E20)

Related Items

Designs with the symmetric difference property on 64 points and their groups ⋮ Quasi-symmetric designs and codes meeting the Grey-Rankin bound ⋮ The uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes] ⋮ Optimal subcodes and optimum distance profiles of self-dual codes ⋮ On linear projective codes which satisfy the chain condition. ⋮ On binary self-complementary [120, 9, 56 codes having an automorphism of order 3 and associated SDP designs] ⋮ Quasi-symmetric designs, codes, quadrics, and hyperplane sections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arcs and ovals in the Hermitian and Ree unitals
• Exponential numbers of two-weight codes, difference sets and symmetric designs
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
• On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
• Symplectic groups, symmetric designs, and line ovals
• Quasi-symmetric designs, codes, quadrics, and hyperplane sections
• Designs with the symmetric difference property on 64 points and their groups
• A classification of self-orthogonal codes over GF(2)
• On the minimal points of positive definite quadratic forms
• Correction to 'Some Bounds for Error-Correcting Codes'
• An updated table of minimum-distance bounds for binary linear codes
• The Closest Packing of Spherical Caps in n Dimensions