New optimal \([52, 26, 10]\) self-dual codes
From MaRDI portal
Publication:2391667
DOI10.1007/s10623-012-9639-9zbMath1337.94106MaRDI QIDQ2391667
Publication date: 5 August 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9639-9
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
Related Items
New binary self-dual codes of lengths 50--60, On the self-dual codes with an automorphism of order 5
Cites Work
- Self-dual codes over GF(4)
- A classification of self-orthogonal codes over GF(2)
- 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
- Automorphisms of codes with applications to extremal doubly even codes of length 48
- Binary self-dual codes of length 24
- Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
- Shadow bounds for self-dual codes
- Doubly-even self-dual code of length 96
- Binary Self-Dual Codes of Lengths 52 to 60 With an Automorphism of Order 7 or 13
- On the classification and enumeration of self-dual codes
- The \([52,26,10\) binary self-dual codes with an automorphism of order 7]
- Some new extremal self-dual codes with lengths 42, 44, 52 and 58
