Singly-even self-dual codes with minimal shadow
classification
🧮 math.CO
cs.ITmath.IT
keywords
codesminimalself-dualshadowsingly-evenextremalboundedbounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.