On the code generated by the incidence matrix of points and hyperplanes in PG(n,q) and its dual

DOI10.1007/S10623-008-9203-9zbMATH Open1185.05031arXiv1201.3290OpenAlexW2093048484MaRDI QIDQ1009044FDOQ1009044

Authors: Michel Lavrauw, Leo Storme, Geertrui Van de Voorde 

Publication date: 31 March 2009

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

Abstract: In this paper, we study the p-ary linear code C(PG(n, q)), q = p^h, p prime, h >= 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n, q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that find- ing the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2, q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar's lower bound [12].

Full work available at URL: https://arxiv.org/abs/1201.3290

Recommendations

• On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
• Linear codes from projective spaces
• Small weight codewords in the dual code of points and hyperplanes in PG\((n, q), q\) even
• Codes arising from incidence matrices of points and hyperplanes in \(\mathrm{PG}(n, q)\)
• Small weight code words arising from the incidence of points and hyperplanes in \(\mathrm{PG}(n,q)\)

zbMATH Keywords

dual codelinear codeincidence matrixblocking setsminimum weightDesarguesian projective spacecodewords

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05)

Cites Work

• Normal spreads
• 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
• Blocking sets in Desarguesian affine and projective planes
• A class of majority logic decodable codes (Corresp.)
• On small blocking sets and their linearity
• Small weight codewords in the codes arising from Desarguesian projective planes
• Small point sets of PG\((2, q)\) intersecting each \(k\)-space in 1 modulo \(\sqrt q\) points
• Scattered spaces with respect to spreads, and eggs in finite projective spaces
• Projective geometric codes
• A \(t\pmod p\) result on weighted multiple \((n-k)\)-blocking sets in \(\mathrm{PG}(n,q)\)
• The \(\mathbb{F}_p\) span of the incidence matrix of a finite projective plane

Cited In (19)

• The \(GF(p)\)-dimension of the codes generated by the classical point-line geometries over \(GF(p)\)
• On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
• An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
• Large weight code words in projective space codes
• A study of intersections of quadrics having applications on the small weight codewords of the functional codes \(C_2(Q)\), \(Q\) a non-singular quadric
• A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\)
• Small weight codewords of projective geometric codes. II
• Small weight code words arising from the incidence of points and hyperplanes in \(\mathrm{PG}(n,q)\)
• Codes arising from incidence matrices of points and hyperplanes in \(\mathrm{PG}(n, q)\)
• A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type
• Small weight codewords in the dual code of points and hyperplanes in PG\((n, q), q\) even
• A \(p\)-adic condition on the weight of a codeword of a linear code
• Linear codes from projective spaces
• On sets without tangents and exterior sets of a conic
• Embedded antipodal planes and the minimum weight of the dual code of points and lines in projective planes of order \(p^2\)
• Rigidity theorems for partial linear spaces
• The use of blocking sets in Galois geometries and in related research areas
• On low weight codewords of generalized affine and projective Reed-Muller codes
• On the number of \(k\)-dominating independent sets

This page was built for publication: On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009044)