Linear codes close to the Griesmer bound and the related geometric structures
DOI10.1007/S10623-018-0565-3zbMATH Open1443.94114OpenAlexW2895099999WikidataQ129128197 ScholiaQ129128197MaRDI QIDQ670207FDOQ670207
Authors: Assia Rousseva, I. Landjev 
Publication date: 18 March 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0565-3
Recommendations
- scientific article; zbMATH DE number 5121640
- scientific article; zbMATH DE number 1795249
- Linear codes associated with geometric structures
- On the geometric constructions of optimal linear codes
- Linear programming bounds for codes in grassmannian spaces
- A geometric approach to classifying Griesmer codes
- Geometric representations of linear codes
- Spazi geometrici e codici lineari associati
- scientific article; zbMATH DE number 3861051
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of Error-Correcting Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- Title not available (Why is that?)
- Codes and projective multisets
- Galois geometries and coding theory
- A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\)
- Title not available (Why is that?)
- On the achievement of the Griesmer bound
- Parameters for which the Griesmer bound is not sharp
- Title not available (Why is that?)
- On codes meeting the Griesmer bound.
- On \(q^2+q+2, q+2\)-arcs in the projective plane \(PG(2,q)\)
- Title not available (Why is that?)
- On the non-existence of linear codes attaining the Griesmer bound
- Note on an improvement of the Griesmer bound for \(q\)-ary linear codes
Cited In (12)
- The \(GF(p)\)-dimension of the codes generated by the classical point-line geometries over \(GF(p)\)
- Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
- Affine blocking sets, three-dimensional codes and the Griesmer bound
- Linear codes with one-dimensional hull associated with Gaussian sums
- A comment on the weight structure of generator matrices of linear codes
- A class of optimal linear codes of length one above the Griesmer bound
- A geometric approach to classifying Griesmer codes
- Hexagonal metric for linear codes over a finite field
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear spaces of quadrics and new good codes
- On the sharpness of the Griesmer bound
This page was built for publication: Linear codes close to the Griesmer bound and the related geometric structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670207)
