An extension theorem for linear codes
From MaRDI portal
DOI10.1023/A:1008319024396zbMATH Open0957.94030OpenAlexW1554098076MaRDI QIDQ1963162FDOQ1963162
Authors: Raymond Hill
Publication date: 24 January 2000
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008319024396
Recommendations
Cited In (47)
- On optimal non-projective ternary linear codes
- The extended codes of projective two-weight 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
- Extendability of quaternary linear codes
- The Use of Blocking Sets in Galois Geometries and in Related Research Areas
- A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)
- On the extendability of quasidivisible Griesmer arcs
- Some improvements to the extendability of ternary linear codes
- Extension theorems for linear codes over finite fields
- An extension theorem for arcs and linear codes
- Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)
- \((l,s)\)-extension of linear codes
- Title not available (Why is that?)
- On the extendability of linear codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extendability of ternary linear codes
- Title not available (Why is that?)
- Note on Niederreiter-Xing's propagation rule for linear codes
- A generalized extension theorem for linear codes
- Title not available (Why is that?)
- An extension theorem for \([n,k,d]_q\) codes with \(\gcd(d,q)=2\)
- Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
- Title not available (Why is that?)
- Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\)
- On complete caps in the projective geometries over \(\mathbb F_3\)
- A geometric approach to classifying Griesmer codes
- New MDS self-dual codes over finite fields
- A new extension theorem for linear codes
- On the characterization of \((3 \bmod 5)\) arcs
- On the \(l\)-extendability of quaternary linear codes
- On the minimum length of linear codes of dimension 5
- Title not available (Why is that?)
- Constructing linear codes from some orbits of projectivities
- Locally two-weight property for linear codes and its application
- Nonexistence of some four dimensional linear codes attaining the Griesmer bound
- An extension of the codes introduced by Séguin, Allard and Bhargava
- On the minimum length of linear codes over the field of 9 elements
- Adding a parity-check bit
- The geometric approach to the existence of some quaternary Griesmer codes
- Nonexistence of some ternary linear codes
- New sufficient conditions for the extendability of quaternary linear codes
- Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9
- On the 3-extendability of quaternary linear codes
- On the minimum length of linear codes over \(\mathbb{F}_5\)
This page was built for publication: An extension theorem for linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963162)