• Journal of applied mathematics & informatics
• /
• v.37 no.1_2
• /
• pp.85-95
• /
• 2019

In this paper, we define near-minimal shadow and study the existence problem of extremal Type I binary self-dual codes with near-minimal shadow. We prove that there is no such codes of length n = 24m + 2($m{\geq}0$), n = 24m + 4($m{\geq}9$), n = 24m + 6($m{\geq}21$), and n = 24m + 10($m{\geq}87$).

• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.729-740
• /
• 2018

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)$.