Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)
From MaRDI portal
Publication:1011445
DOI10.1016/j.ffa.2008.09.003zbMath1181.94121OpenAlexW2014547771MaRDI QIDQ1011445
Publication date: 8 April 2009
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2008.09.003
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Blocking sets, ovals, (k)-arcs (51E21)
Related Items (2)
Extension theorems for linear codes over finite fields ⋮ A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension theorem for arcs and linear codes
- New sufficient conditions for the extendability of quaternary linear codes
- Some improvements to the extendability of ternary linear codes
- On optimal linear codes over \(\mathbb F_5\)
- On the minimum size of some minihypers and related linear codes
- 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
- A new extension theorem for linear codes
- Fundamentals of Error-Correcting Codes
- Adding a parity-check bit
- Coding and Cryptography
- On the extendability of linear codes
This page was built for publication: Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)
