Title
Maximum distance separable codes and arcs in projective spaces
Abstract
Given any linear code C over a finite field GF(q) we show how C can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case of MDS codes we use our new approach to offer improvements to the main results currently available concerning MDS extensions of linear MDS codes. We also sharply limit the possibilities for constructing long non-linear MDS codes. Our proofs make use of the connection between the work of Redei [L. Redei, Lacunary Polynomials over Finite Fields, North-Holland, Amsterdam, 1973. Translated from the German by I. Foldes. [18]] and the Redei blocking sets that was first pointed out over thirty years ago in [A.A. Bruen, B. Levinger, A theorem on permutations of a finite field, Canad. J. Math. 25 (1973) 1060-1065]. The main results of this paper significantly strengthen those in [A. Blokhuis, A.A. Bruen, J.A. Thas, Arcs in PG(n,q), MDS-codes and three fundamental problems of B. Segre-Some extensions, Geom. Dedicata 35 (1-3) (1990) 1-11; A.A. Bruen, J.A. Thas, A.Blokhuis, On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre, Invent. Math. 92 (3) (1988) 441-459].
Year
DOI
Venue
2007
10.1016/j.jcta.2006.11.005
J. Comb. Theory, Ser. A
Keywords
Field
DocType
b. levinger,mds codes,projective space,maximum distance separable code,arcs,complete arcs,b. segre-some extension,mds code,main result,mds extension,b. segre,dual arcs,finite field,linear mds code,long non-linear mds code,linear codes,code extensions,fundamental problem,linear code
Discrete mathematics,Combinatorics,Finite field,Polynomial,Permutation,Separable space,Mathematical proof,Linear code,Lacunary function,Mathematics,Projective test
Journal
Volume
Issue
ISSN
114
6
Journal of Combinatorial Theory, Series A
Citations 
PageRank 
References 
7
0.73
4
Authors
3
Name
Order
Citations
PageRank
T. L. Alderson1699.04
A. A. Bruen2387.27
R. Silverman370.73