Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let n q(k, d) denote the smallest value of n for which there exists a linear [n, k, d]-code over the Galois field GF (q). An [n, k, d]-code whose length is equal to nq(k, d) is called optimal. In this paper we present some matrix generators for the family of optimal [n, 3, d] codes over GF (7) and GF (11). Most of our given codes in GF (7) are nonisomorphic with the codes presented before. Our given codes in GF (11) are all new.