Singly-even self-dual codes with minimal shadow
Combinatorics
2012-10-10 v2 Information Theory
math.IT
Abstract
In this note we investigate extremal singly-even self-dual codes with minimal shadow. For particular parameters we prove non-existence of such codes. By a result of Rains \cite{Rains-asymptotic}, the length of extremal singly-even self-dual codes is bounded. We give explicit bounds in case the shadow is minimal.
Cite
@article{arxiv.1106.5936,
title = {Singly-even self-dual codes with minimal shadow},
author = {Stefka Bouyuklieva and Wolfgang Willems},
journal= {arXiv preprint arXiv:1106.5936},
year = {2012}
}