Singly-even self-dual codes with minimal shadow
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 Rains-asymptotic, the length of extremal singly-even self-dual codes is bounded. We give explicit bounds in case the shadow is minimal.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.