New sufficient conditions for the extendability of quaternary linear codes (Q938759): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ffa.2007.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059639895 / rank
 
Normal rank

Revision as of 03:48, 20 March 2024

scientific article
Language Label Description Also known as
English
New sufficient conditions for the extendability of quaternary linear codes
scientific article

    Statements

    New sufficient conditions for the extendability of quaternary linear codes (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2008
    0 references
    Let \(\mathbb{F}_{q}\) be a finite field of characteristic \(p\) with \(q=p^{r}\) elements, and \({ \text C}\) a linear non-degenerate \([n,k,d]_{q}\)-code of length \(n\) with dimension \(k\) whose minimum Hamming distance is \(d\). The code obtained by deleting the same coordinate from each codeword of \({ \text C}\) is called a \({\text punctured}\) \({\text code}\) of \({ \text C}\). If there exists a linear \([n+1, k, d+1]_{q}\)-code \({ \text C'}\) which gives \({ \text C}\) as a punctured code then \({ \text C}\) is called \({\text extendable}\) (to \({ \text C'}\)) and \({ \text C'}\) is an \({ \text extension}\) of \({ \text C}\). It is well known [see, \textit{R.Hill}, A first course in coding theory. Oxford Applied Mathematics and Computing Science Series. Oxford: Clarendon Press. (1986; Zbl 0616.94006)] that \([n,k,d]_{2}\)-codes with \(d\) odd are always extendable. For an \([n,k,d]_{4}\)-code \({ \text C}\) with \(d\) odd, let \(A_{i}\) be the number of codewords of \({ \text C}\) with weight \(i\). Then the diversity of \({ \text C}\) is defined as the \(3\)-tuple \(( \Phi_{0}, \Phi_{1}, \Phi_{2})\) with \[ \Phi_{0}= \frac{1}{3} \sum_{{i>0} \atop {i \equiv 0 ( \bmod\,4)}}A_{i}, \] \[ \Phi_{j}= \frac{1}{3} \sum_{i \equiv -j ( \bmod\,4)} A_{i} \quad { \text{for}} \quad j=1,2 \quad {\text{when}} \quad d \equiv 1 ( \bmod\, 4), \] \[ \Phi_{j}= \frac{1}{3} \sum_{i \equiv j ( \bmod\,4)} A_{i} \quad { \text{for}} \quad j \equiv 1,2 \quad { \text{when}} \quad d \equiv 3 ( \bmod\,4). \] The authors prove that an \([n,k,d]_{4}\)-code with \(k \geq 3\) and \(d \equiv 1 (\bmod\,2)\) is extendable if \( \Phi_{0}+ \Phi_{2}= \theta_{k-2}+2 \times 4^{k-2}\) or \( \Phi_{0}= \theta_{k-4}\), where \( \theta_{j}=(4^{j}-1)/3\). Next, for the case when \(k=3\), the authors show that \( \text C\) is extendable if \(( \Phi_{0}, \Phi_{1}, \Phi_{2}) \notin \{(6,1,3), (6,3,3), (2,3,7) \}\). Finally, if \[ ( \Phi_{0}, \Phi_{1}, \Phi_{2}) \in \{(6,1,3), (6,3,3), (2,3,7) \}, \] the authors give some geometric necessary and sufficient conditions for the non-extendability of \( \text C\).
    0 references
    0 references
    extension
    0 references
    quaternary linear codes
    0 references
    optimal codes
    0 references
    projective geometry
    0 references
    0 references