Blocking sets in finite projective spaces and uneven binary codes

DOI10.1016/0012-365X(91)90307-NMaRDI QIDQ1182740zbMATH OpenFDO

Authors W. Edwin Clark

Publication date 28 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

blocking setsfinite projective spaceuneven binary codes

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• scientific article; zbMATH DE number 872500
• Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
• Lower bounds for the cardinality of minimal blocking sets in projective spaces
• Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)
• On the non-trivial minimal blocking sets in binary projective spaces

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Binary set functions and parity check matrices
• Blocking sets and partial spreads in finite projective spaces

Cited in

(5)

• Flat-containing and shift-blocking sets in \({\mathbb F}^{r}_{2}\)
• Sum-free sets in vector spaces over \(GF(2)\)
• On cutting blocking sets and their codes
• Partial covers of \(\mathrm{PG}(n, q)\)
• Blocking sets, minimal codes and trifferent codes

This page was built for publication: Blocking sets in finite projective spaces and uneven binary codes

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