Projective Linear Codes From Some Almost Difference Sets

Projective linear codes are a special class of linear codes whose duals have minimum distance at least 3. The columns of the generator matrix of an $[n,k]$ projective code over finite field ${\mathbb {F}}_{q}$ can be viewed as points in the projective space $\text {PG}(k-1, {\mathbb {F}}_{q})$ . Projective codes are of interest not only because their duals have good error correcting capability but also because they may be related to interesting combinatorial structures. The objective of this paper is to construct projective linear codes with five families of almost difference sets. To this end, the augmentation and extension techniques for linear codes are used. The parameters and weight distributions of the projective codes are explicitly determined. Several infinite families of optimal or almost optimal codes including MDS codes, near MDS codes, almost MDS odes and Griesmer codes are obtained. Besides, we also give some applications of these codes.