Linear codes over finite fields and finite projective geometries

DOI10.1016/S0012-365X(99)00183-1zbMath0990.94027MaRDI QIDQ1970716

Ivan N. Landgev

Publication date: 19 November 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

capslinear codesfinite geometriesarcsprojective geometries

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Combinatorial aspects of finite geometries (05B25) General theory of linear incidence geometry and projective geometries (51A05)

Related Items (13)

Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ Combinatorial families enumerated by quasi-polynomials ⋮ Unnamed Item ⋮ Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes ⋮ An extension theorem for arcs and linear codes ⋮ Some subfield codes from MDS codes ⋮ The geometric approach to the existence of some quaternary Griesmer codes ⋮ A general construction for blocking sets in finite affine geometries ⋮ A geometric non-existence proof of an extremal additive code ⋮ Some subsets of points in the plane associated to truncated Reed-Muller codes with good parameters ⋮ Elliptic near-MDS codes over \(\mathbb{F}_5\) ⋮ Near-MDS codes arising from algebraic curves ⋮ Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture

This page was built for publication: Linear codes over finite fields and finite projective geometries