A geometric construction of a (38,2)-blocking set in PG(2,13) and the related [145,3,133]13 code

被引:0
作者
Daskalov, Rumen [1 ]
机构
[1] Tech Univ Gabrovo, Dept Math, Gabrovo 5300, Bulgaria
关键词
projective plane; arc; blocking set; linear codes;
D O I
10.1016/j.disc.2007.03.078
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
An (l, n)-blocking set S in PG(2, q) is a set of I points such that every line of PG(2, q) intersects S in at least n points, and there is a line intersecting S in exactly n points. In this paper we give a geometrical construction of a (38, 2)-blocking set in PG(2, 13). (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:1341 / 1345
页数:5
相关论文
共 3 条
[1]   Bounds on (n, r)-arcs and their application to linear codes [J].
Ball, S ;
Hirschfeld, JWP .
FINITE FIELDS AND THEIR APPLICATIONS, 2005, 11 (03) :326-336
[2]  
BRAUN M, 2005, INNOV INCIDENCE GEOM, V1, P133
[3]  
HILL R, 1992, CRYPTOGRAPHY CODING, V2, P75