A new extension theorem for linear codes
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.
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- Adding a parity-check bit
- An extension theorem for linear codes
- Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
- Extendability of quaternary linear codes
- Extendability of ternary linear codes
- scientific article; zbMATH DE number 3917102 (Why is no real title available?)
- scientific article; zbMATH DE number 1189046 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 1795249 (Why is no real title available?)
- On optimal codes over the field with five elements
- On the extendability of linear codes
- Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)
- On optimal linear codes over \(\mathbb F_5\)
- An extension of the codes introduced by Séguin, Allard and Bhargava
- Note on Niederreiter-Xing's propagation rule for linear codes
- On the 3-extendability of quaternary linear codes
- On the characterization of \((3 \bmod 5)\) arcs
- Extendability of quaternary linear codes
- Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
- A new extension theorem for ternary linear codes and its application
- Divisible arcs, divisible codes, and the extension problem for arcs and codes
- On the minimum length of linear codes over \(\mathbb{F}_5\)
- On optimal non-projective ternary linear codes
- Geometric extending of divisible codes and construction of new linear codes
- On the extendability of quasidivisible Griesmer arcs
- The use of blocking sets in Galois geometries and in related research areas
- Some generalizations of extension theorems for linear codes over finite fields
- An extension theorem for \([n,k,d]_q\) codes with \(\gcd(d,q)=2\)
- The non-existence of (104,22;3,5)-arcs
- On optimal linear codes of dimension 4
- Update on the Extension of Good Linear Codes
- Extension theorems for linear codes over finite fields
- scientific article; zbMATH DE number 2154148 (Why is no real title available?)
- scientific article; zbMATH DE number 1932956 (Why is no real title available?)
- scientific article; zbMATH DE number 7360049 (Why is no real title available?)
- On the minimum length of linear codes over the field of 9 elements
- Non-existence of some 4-dimensional Griesmer codes over finite fields
- Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\)
- The Extended Codes of Some Linear Codes
- Nonexistence of some four dimensional linear codes attaining the Griesmer bound
- The extended codes of projective two-weight codes
- A generalized extension theorem for linear codes
- The non-existence of \([383, 5, 286]\) and \([447, 5, 334]\) quaternary linear codes
- The nonexistence of some ternary linear codes of dimension 6
- A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)
- On linear codes whose weights and length have a common divisor
- New sufficient conditions for the extendability of quaternary linear codes
- Some improvements to the extendability of ternary linear codes
- \((l,s)\)-extension of linear codes
This page was built for publication: A new extension theorem for linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566961)