A new extension theorem for linear codes (Q2566961): Difference between revisions

This paper studies \([n,R,d]_q\) codes which are linear, of length \(n\) with dimension \(k\), over the finite field \(\text{GF}(q)\) of order \(q\), having minimum Hamming distance \(d\). The weight distribution of the code is considered to be the list of numbers \(A_i\) which is the number of codewords with weight \(i\). All the diversities for such codes with \(k\geq 3\), \(d\equiv-2\pmod q\) such that \(A_i= 0\) for all \(i\not\equiv 0,-1,02\pmod q\) have been found and characterized with their spectra geometrically. This yields that such codes are extendable for all odd \(q\geq 5\). Double extendability of such codes has also been investigated.