arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.02702math.CO
收藏

PG(2,q)中(n,r)-弧长的新下界

New lower bounds on the size of (n,r)-arcs in PG(2,q)

Michael Braun

摘要:

PG(2,q)中的(n,r)-弧是一组n个点,使得每条线最多包含r个选定点。众所周知,PG(2,q)中的(n,r)-弧对应于射影线性码。设m_r(2,q)表示PG(2,q)中存在(n,r)-弧的最大点数n。本文通过显式构造(n,r)-弧来获得m_r(2,q)的改进的下界。一些构造的(n,r)-弧对应于满足Griesmer界的线性码。所有结果均由整数线性规划求得。

英文摘要:

An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let m_r(2,q) denote the maximal number n of points for which an (n,r)-arc in PG(2,q) exists. In this paper we obtain improved lower bounds on m_r(2,q) by explicitly constructing (n,r)-arcs. Some of the constructed (n,r)-arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑