Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903762 | Journal of Combinatorial Theory, Series A | 2018 | 13 Pages |
Abstract
In this paper, we prove a stability result on k mod p multisets of points in PG(2,q), q=ph. The particular case k=0 is used to describe small weight codewords of the code generated by the lines of PG(2,q), as linear combination of few lines. Earlier results proved this for codewords with weight less than 2.5q, while our result is valid until cqq. It is sharp when 27
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tamás SzÅnyi, Zsuzsa Weiner,