We give four new extension theorems for linear codes over Fq :( a) Forq = 2 h , h ≥ 3, every [n, k, d]q code with d odd whose weights are congruent to 0o rd (mod q/2) is extendable. (b) For q =2 h , h ≥ 3, every [n, k, d]q code with gcd(d, q) = 2 whose weights are congruent to 0 or d (mod q )i s doubly extendable. (c) For integers h, m, t with 0 ≤ m<t ≤ h and prime p ,e very [n, k, d]q code with gcd(d, q )= p m and q = p h is extendable if �
['Tatsuya Maruta', 'Taichiro Tanaka', 'Hitoshi Kanda']
Some generalizations of extension theorems for linear codes over finite fields