New sufficient conditions for the extendability of quaternary linear codes
From MaRDI portal
Publication:938759
DOI10.1016/j.ffa.2007.09.001zbMath1175.94123MaRDI QIDQ938759
Tatsuya Maruta, Maiko Takeda, Kumiko Kawakami
Publication date: 27 August 2008
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2007.09.001
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
Related Items
Classification of the odd sets in \(\mathrm{PG}(4,4)\) and its application to coding theory, Extension theorems for linear codes over finite fields, A characterization of some odd sets in projective spaces of order 4 and the extendability of quaternary linear codes, On the \(l\)-extendability of quaternary 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 the 3-extendability of quaternary linear codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification of some optimal ternary linear codes of small length
- Some improvements to the extendability of ternary linear codes
- \((l,s)\)-extension of linear codes
- Improved bounds for quaternary linear codes of dimension 6.
- 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
- Optimal four-dimensional codes over \(\text{GF}(8)\)
- A new extension theorem for linear codes
- Adding a parity-check bit
- Coding and Cryptography
- On the extendability of linear codes
