New linear codes over \(\mathbb{F}_3\) and \(\mathbb{F}_5\) and improvements on bounds (Q5926326)

An important problem in coding theory is to construct codes with the best possible minimum distance. In this paper, a method introduced by \textit{T. A. Gulliver} and \textit{M. Harada} [ibid. 22, 89-96 (2001; Zbl 0961.94013)] is generalized to obtain new codes which improve the best known minimum distance bounds on some linear codes over GF(3) and GF(5). A generalized Gray map is presented, and nearly quasi-cyclic codes are introduced. The generator matrices and Hamming weight enumerators of the new codes are given.