On codewords in the dual code of classical generalised quadrangles and classical polar spaces
From MaRDI portal
Publication:712227
DOI10.1016/J.DISC.2009.06.010zbMATH Open1226.94016arXiv1201.3294OpenAlexW2085741104MaRDI QIDQ712227FDOQ712227
Authors: Valentina Pepe, Geertrui Van de Voorde, Leo Storme 
Publication date: 28 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: In [9], the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the code of points and generators of Q+(5, q) and H(5, q2), and we present lower bounds on the weight of the codewords in the dual of the code of points and k-spaces of the classical polar spaces. Furthermore, we investigate the codewords with the largest weights in these codes, where for q even and k sufficiently small, we determine the maximum weight and characterise the codewords of maximum weight. Moreover, we show that there exists an interval such that for every even number w in this interval, there is a codeword in the dual code of Q+(5, q), q even, with weight w and we show that there is an empty interval in the weight distribution of the dual of the code of Q(4, q), q even. To prove this, we show that a blocking set of Q(4, q), q even, of size q2 +1+r, where 0 < r < (q +4)/6, contains an ovoid of Q(4, q), improving on [5, Theorem 9].
Full work available at URL: https://arxiv.org/abs/1201.3294
Recommendations
- Small weight codewords in the dual code of points and hyperplanes in PG\((n, q), q\) even
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Large weight code words in projective space codes
- Binary codes of the symplectic generalized quadrangle of even order
- A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type
Generalized quadrangles and generalized polygons in finite geometry (51E12) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- A non-existence result on Cameron–Liebler line classes
- Title not available (Why is that?)
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Good error-correcting codes based on very sparse matrices
- On a particular class of minihypers and its applications. I: The result for general \(q\)
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- A recursive approach to low complexity codes
- Note on (q+2)-Sets in A Galois Plane of Order q
- Intersections in projective space. II: Pencils of quadrics
- An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
- LDPC Codes From Generalized Polygons
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Blocking structures of Hermitian varieties
- Title not available (Why is that?)
- On blocking sets of quadrics
- Ovoidal translation planes
- Covers and blocking sets of classical generalized quadrangles
- Classification of ovoids in \(PG(3,32)\)
- Minimum-distance bounds by graph analysis
- Covers of \(\mathrm{PG}(3,q)\) and of finite generalized quadrangles
- A Bose-Burton type theorem for quadrics
Cited In (11)
- Title not available (Why is that?)
- Binary codes of the symplectic generalized quadrangle of even order
- On the dual of quaternary Goethals code
- 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
- One-step completely orthogonalizable codes from generalized quadrangles
- Algebraic codes and geometry of some classical generalized polygons
- On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
- Small weight codewords in the dual code of points and hyperplanes in PG\((n, q), q\) even
- On the dual code of points and generators on the Hermitian variety \(\mathcal{H}(2n+1,q^2)\)
- Some combinatorial aspects of constructing bipartite-graph codes
Uses Software
This page was built for publication: On codewords in the dual code of classical generalised quadrangles and classical polar spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712227)
