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

关于PG(n,q)中点与超平面的关联矩阵生成的码及其对偶

On the code generated by the incidence matrix of points and hyperplanes in PG(n,q) and its dual

Michel Lavrauw, Leo Storme, Geertrui Van de Voorde

摘要:

本文研究了由点与超平面的关联矩阵生成的p元线性码C(PG(n,q)),q = p^h,p素,h >= 1及其对偶码.我们链接的码字的小重量,这个代码的阻塞集相对于PG(n,q)中的线,我们排除所有可能的码字所产生的小线性阻塞集。我们还研究了C(PG(n,q))的对偶码,证明了寻找对偶码的最小权可以归结为寻找PG(2,q)中点和线的对偶码的最小权。我们提出了一个改进的上界这个最小重量,我们表明,我们可以下降的可分性条件的重量的码字在Sachar的下界[12]。

英文摘要:

In this paper, we study the p-ary linear code C(PG(n, q)), q = p^h, p prime, h >= 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n, q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that find- ing the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2, q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar's lower bound [12].

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

↑