A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)

DOI10.1007/s10623-009-9275-1zbMath1174.94034OpenAlexW1986866816MaRDI QIDQ735020

Tatsuya Maruta, Eun Ju Cheon

Publication date: 14 October 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9275-1

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Related Items (2)

Extension theorems for linear codes over finite fields ⋮ On the minimum length of linear codes over the field of 9 elements

Cites Work

• 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
• \((l,s)\)-extension of linear codes
• Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)
• 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
• Adding a parity-check bit
• The nonexistence of some five-dimensional quaternary linear codes
• On the extendability of linear codes

This page was built for publication: A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)