A new extension theorem for linear codes
From MaRDI portal
Publication:2566961
DOI10.1016/j.ffa.2004.02.001zbMath1075.11082OpenAlexW1966784048MaRDI QIDQ2566961
Publication date: 29 September 2005
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2004.02.001
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (23)
On the extendability of quasidivisible Griesmer arcs ⋮ The non-existence of \((104,22;3,5)\)-arcs ⋮ The Use of Blocking Sets in Galois Geometries and in Related Research Areas ⋮ On the minimum length of linear codes over \(\mathbb{F}_5\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Divisible arcs, divisible codes, and the extension problem for arcs and codes ⋮ Extension theorems for linear codes over finite fields ⋮ Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\) ⋮ A generalized extension theorem for linear codes ⋮ New sufficient conditions for the extendability of quaternary linear codes ⋮ On the characterization of \((3 \bmod 5)\) arcs ⋮ Some improvements to the extendability of ternary linear codes ⋮ On optimal non-projective ternary linear codes ⋮ A new extension theorem for ternary linear codes and its application ⋮ On the minimum length of linear codes over the field of 9 elements ⋮ The nonexistence of some ternary linear codes of dimension 6 ⋮ Extendability of quaternary linear codes ⋮ \((l,s)\)-extension of linear codes ⋮ A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\) ⋮ Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\) ⋮ On optimal linear codes of dimension 4 ⋮ On optimal linear codes over \(\mathbb F_5\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On optimal codes over the field with five elements
- Extendability of quaternary linear codes
- Extendability of ternary linear codes
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
- An extension theorem for linear codes
- Adding a parity-check bit
- On the extendability of linear codes
This page was built for publication: A new extension theorem for linear codes