Combinatorial t-designs and Strongly Regular Graphs from Projective Codes over Finite Fields
Projective codes over finite fields have important applications in combina-torial designs and strongly regular graphs.In this paper,we first construct a family of linear codes and then study their parameters and weight distributions in four cases.It turns out that the proposed linear codes are projective and are optimal in two cases.The duals of these codes are either optimal or almost optimal according to the sphere-packing bound.As applications,these codes are used to construct t-designs and strongly regular graphs.
NETL
NSTL
万方数据
维普
