Answers are grounded in this paper and cite their sources.
Mathematical study demonstrates improved lower bounds for dual incidence codes in projective spaces, indicating tighter theoretical constraints on code weights.
The p -ary code associated with the incidence structure of points and t -spaces in a projective space \,PG\,(m,q) PG ( m , q ) , where q=pʰ q = p h , is the Fₚ F p -subspace generated by the incidence vectors of the blocks of this design. The dual of this code consists of all vectors orthogonal to every codeword of the original code. The minimum weight of this dual code has been studied since the 1970s; the currently best known lower bound is from 2002 by Bagchi and Inamdar. In this paper we provide a substantial improvement of this bound in the case when $$h>1$$ h > 1 and $$m, p >2$$ m , p > 2 . The main ingredient of the proof is a lower bound on the size of multisets of AG(m,q) AG ( m , q ) meeting each line in 0 p 0 mod p points. We prove this, by generalising the polynomial argument in [S. Ball, A. Blokhuis, A. Gács, P. Sziklai, Zs. Weiner: On linear codes whose weights and length have a common divisor, Adv. Math., 211 (2007), 94–104] from (ordinary) planar point sets to multisets in higher dimensional spaces. While the sharpness of the planar result for point sets is in general not known, we can show that our result for multisets is sharp for every h,m,p≥ 2 h , m , p ≥ 2 .
No takes yet. Share an insight, caveat, or question.
Csajbók et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: