Large weight code words in projective space codes

DOI10.1016/j.laa.2012.03.024zbMath1260.94084OpenAlexW2061795127MaRDI QIDQ426076

Jirapha Limbupasiriporn, Storme, L., Peter Vandendriessche

Publication date: 11 June 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.03.024

zbMATH Keywords

blocking sets\(2\pmod 3\) setsprojective geometry codesweights of code words

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Blocking sets, ovals, (k)-arcs (51E21)

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• LDPC codes associated with linear representations of geometries
• Regular LDPC codes from semipartial geometries
• On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
• On small blocking sets and their linearity
• Small weight codewords in the codes arising from Desarguesian projective planes
• On the code generated by the incidence matrix of points and hyperplanes 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)\)
• Blocking sets in Desarguesian affine and projective planes
• Some low-density parity-check codes derived from finite geometries
• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
• LDPC Codes From Generalized Polygons
• Small weight codewords in the LDPC codes arising from linear representations of geometries
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• Small blocking sets in higher dimensions