On the maximum size of some \((k,r)\)-arcs in PG\((2,q)\) (Q2467737): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q1812378 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Storme, L. / rank | |||
Property / author | |||
Property / author: Rumen N. Daskalov / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Storme, L. / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.03.028 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995183330 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4011770 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5524220 / rank | |||
Normal rank |
Latest revision as of 16:03, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the maximum size of some \((k,r)\)-arcs in PG\((2,q)\) |
scientific article |
Statements
On the maximum size of some \((k,r)\)-arcs in PG\((2,q)\) (English)
0 references
28 January 2008
0 references
A \((k,r)\)-arcin PG\((2,q)\) is a set of \(k\) points, such that some \(r\), but no \(r+1\) of them, are collinear. The maximum size of a \((k,r)\)-arc in PG\((2,q)\) is denoted by \(m_r(2,q)\). \textit{S. Ball} [J. Lond. Math. Soc. (2) 54, No.~3, 581--593 (1996; Zbl 0904.51002)] proved that in PG\((2,q)\), \(q\) prime, \(m_r(2,q)\leq (r-1)q+r-(q+1)/2\) for \(r\geq (q+3)/2\). For \(r=(q+3)/2\), this bound is sharp. In this article, it is proven that \(m_r(2,q)\leq (r-1)q+r-(q+3)/2\), for \(r>(q+3)/2\) and \(q=17,19,23,29\). As an application of these results, the results are interpreted for linear codes in relation with the Griesmer lower bound. The Griesmer bound states a lower bound \(g_q(k,d)\) on the length of a linear \([n,k,d]\)-code over the finite field \(\mathbb{F}_q\) of order \(q\). The results presented here imply that there do not exist linear codes (meeting the Griesmer bound) with parameters \([(r-1)q+r-(q+1)/2,3,(r-1)q-(q+1)/2]_q\), for \((q+3)/2<r<q\) and \(q=7,11,13,17,19,23,29\).
0 references
projective plane
0 references
arc
0 references
blocking set
0 references
linear codes
0 references