Extremal Type I additive self-dual codes over $GF(4)$ with near-minimal shadow
Main Article Content
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)$.
Article Details
References
[1] E.P. Bautista, P. Gaborit, J.-L. Kim, J.L. Walker, s-extremal additive codes, Adv. Math. Commun. 1 (2007), 111–130. Google Scholar
[2] W. Bosma, J. Cannon, C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997), 235–265. Google Scholar
[3] P. Gaborit, W.C. Huffman, J.-L. Kim, V. Pless, On additive GF(4) codes, in: A. Barg, S. Litsyn (Eds.), Codes and Association Schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 56, American Mathematical Society, Providence, RI, 2001, 135–149. Google Scholar
[4] S. Han, Additive self-dual codes over GF(4) with minimal shadow, MDPI Information 9 81 (2018), 1-11. Google Scholar
[5] S. Han, Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4), MDPI Information 9 172 (2018), 1-12. Google Scholar
[6] S. Han, On the extremal Type I binary self-dual codes with near-minimal shadow, submitted. Google Scholar
[7] G. Höhn, Self-dual codes over the Kleinian four group, Math. Ann. 327 (2003), 227–255. Google Scholar
[8] W.C. Huffman, On the classification and enumeration of self-dual codes, Finite Fields Appl. 11 (2005), 451-490. Google Scholar
[9] E.M. Rains, Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory 44 (1998), 134-139. Google Scholar