Extension theorems for linear codes over finite fields
From MaRDI portal
Publication:408950
DOI10.1007/S00022-011-0088-9zbMATH Open1264.94114OpenAlexW2042898199MaRDI QIDQ408950FDOQ408950
Publication date: 12 April 2012
Published in: Journal of Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00022-011-0088-9
Recommendations
- Some generalizations of extension theorems for linear codes over finite fields
- A generalized extension theorem for linear codes
- A new extension theorem for linear codes
- Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
- An extension theorem for linear codes
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extension theorem for arcs and linear codes
- Title not available (Why is that?)
- On the extendability of linear codes
- A generalized extension theorem for linear codes
- On the maximality of linear codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extendability of quaternary linear codes
- New sufficient conditions for the extendability of quaternary linear codes
- Ternary linear codes and quadrics
- Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)
- Divisibility of codes meeting the Griesmer bound
- On codes meeting the Griesmer bound.
- 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
- Optimal four-dimensional codes over \(\text{GF}(8)\)
- Necessary and sufficient conditions for the extendability of ternary linear codes
- Adding a parity-check bit
- Some new results for optimal ternary linear codes
- Title not available (Why is that?)
- New binary codes
- On optimal linear codes over \(\mathbb F_8\)
- Classification of some optimal ternary linear codes of small length
- A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)
- Some improvements to the extendability of ternary linear codes
- \((l,s)\)-extension of linear codes
Cited In (26)
- The extended codes of projective two-weight codes
- Update on the Extension of Good Linear Codes
- Divisible arcs, divisible codes, and the extension problem for arcs and codes
- On optimal linear codes over \(\mathbb F_5\)
- On the minimum length of ternary linear codes
- On the extendability of quaternary linear codes with four weights modulo 16
- Shortened Linear Codes Over Finite Fields
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- On the extendability of quasidivisible Griesmer arcs
- \((l,s)\)-extension of linear codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalized extension theorem for linear codes
- On optimal linear codes of dimension 4
- A characterization of some odd sets in projective spaces of order 4 and the extendability of quaternary linear codes
- On the geometric constructions of optimal linear codes
- Nonexistence of some linear codes over the field of order four
- Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
- On the \(l\)-extendability of quaternary linear codes
- FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
- Classification of the odd sets in \(\mathrm{PG}(4,4)\) and its application to coding theory
- On the minimum length of linear codes over the field of 9 elements
- The geometric approach to the existence of some quaternary Griesmer codes
- Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9
- On the minimum length of some linear codes
- On the 3-extendability of quaternary linear codes
This page was built for publication: Extension theorems for linear codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408950)
