A new class of optimal linear codes with flexible parameters

In this paper, we construct a class of linear codes over the local ring R=Fq+uFq and determine the Lee distribution by employing character sums. Using the Gray map, we obtain a class of linear codes with two weights over Fq. These linear codes are proved to be optimal with respect to the Griesmer bound. Notably, the parameters of these linear codes are flexible and new. As an application, we employ these linear codes to construct association schemes.