<p>A strong <i>s</i>-blocking set in a projective space is a set of points that intersects each codimension-<i>s</i> subspace in a spanning set of the subspace. We present an explicit construction of such sets in a <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\((k - 1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-dimensional projective space over <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation> of size <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(O_s(q^s k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>O</mi> <mi>s</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msup> <mi>q</mi> <mi>s</mi> </msup> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, which is optimal up to the constant factor depending on <i>s</i>. This also yields an optimal explicit construction of affine blocking sets in <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\mathbb {F}_q^k\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi mathvariant="double-struck">F</mi> <mi>q</mi> <mi>k</mi> </msubsup> </math></EquationSource> </InlineEquation> with respect to codimension-<InlineEquation ID="IEq5"> <EquationSource Format="TEX">\((s+1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>s</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> affine subspaces, and of <i>s</i>-minimal codes. Our approach is motivated by a recent construction of Alon, Bishnoi, Das, and Neri of strong 1-blocking sets, which uses expander graphs with a carefully chosen set of vectors as their vertex set. The main novelty of our work lies in constructing specific hypergraphs on top of these expander graphs, where tree-like configurations correspond to strong <i>s</i>-blocking sets. We also discuss some connections to size-Ramsey numbers of hypergraphs, which might be of independent interest.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Explicit Constructions of Optimal Blocking Sets and Minimal Codes

  • Anurag Bishnoi,
  • István Tomon

摘要

A strong s-blocking set in a projective space is a set of points that intersects each codimension-s subspace in a spanning set of the subspace. We present an explicit construction of such sets in a \((k - 1)\) ( k - 1 ) -dimensional projective space over \(\mathbb {F}_q\) F q of size \(O_s(q^s k)\) O s ( q s k ) , which is optimal up to the constant factor depending on s. This also yields an optimal explicit construction of affine blocking sets in \(\mathbb {F}_q^k\) F q k with respect to codimension- \((s+1)\) ( s + 1 ) affine subspaces, and of s-minimal codes. Our approach is motivated by a recent construction of Alon, Bishnoi, Das, and Neri of strong 1-blocking sets, which uses expander graphs with a carefully chosen set of vectors as their vertex set. The main novelty of our work lies in constructing specific hypergraphs on top of these expander graphs, where tree-like configurations correspond to strong s-blocking sets. We also discuss some connections to size-Ramsey numbers of hypergraphs, which might be of independent interest.