Abstract
In this paper, we define near-minimal shadow and study the existence problem of extremal Type I additive self-dual codes over $GF(4)$ with near-minimal shadow. We prove that there is no such codes if the code length $n = 6m+1 (m \geq 0)$, $n = 6m+5 (m \geq 1)$.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
