Self-orthogonal \(3-(56,12,65)\) designs and extremal doubly-even self-dual codes of length 56

DOI10.1007/s10623-004-5657-6zbMath1142.94385OpenAlexW2005430442MaRDI QIDQ2491254

Masaaki Harada

Publication date: 29 May 2006

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

Full work available at URL: https://doi.org/10.1007/s10623-004-5657-6

zbMATH Keywords

self-orthogonal designextremal doubly-even self-dual code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05)

Related Items (7)

Mutually disjoint \(t\)-designs and \(t\)-SEEDs from extremal doubly-even self-dual codes ⋮ New binary self-dual codes of lengths 50--60 ⋮ Construction for both self-dual codes and LCD codes ⋮ Block designs from self-dual codes obtained from Paley designs and Paley graphs ⋮ Configurations of extremal type II codes via harmonic weight enumerators ⋮ Skew Hadamard designs and their codes ⋮ 3-(2^m, 2^m–1, 2^m–2–1) design for first order Reed-Muller code R(1,m)

Cites Work

• Unnamed Item
• On a 5-design related to an extremal doubly even self-dual code of length 72
• A characterization of designs related to the Witt system S(5,8,24)
• Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture
• New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28
• Classification of extremal double-circulant self-dual codes of length up to \(62\)
• Existence of new extremal doubly-even codes and extremal singly-even codes
• A new upper bound on the minimal distance of self-dual codes
• A method for constructing inequivalent self-dual codes with applications to length 56
• A characterization of a (56,28) extremal self-dual code (Corresp.)
• New 5-designs
• An upper bound for self-dual codes

This page was built for publication: Self-orthogonal \(3-(56,12,65)\) designs and extremal doubly-even self-dual codes of length 56