Handbook of Coding Theory
A Note on MDS Codes, n-Arcs and Complete Designs
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A set of n + k points (k 0) in projective space of dimension n is said to be an (n + k)-arc if there is no hyperplane containing any n + 1 points of the set. It is well-known that for the projective space PG(n, q), this is equivalent to a maximum distance separable linear code with symbols in the finite field GF(q), of length n + k, dimension n + 1, and distance d = k that satisfies the Singleton bound d 驴 k. We give an algebraic condition for such a code, or set of points, and this is associated with an identity involving determinants.