New Linear Codes over $GF(3)$, $GF(11)$, and $GF(13)$

Explicit construction of linear codes with best possible parameters is one of the major and challenging problems in coding theory. Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, are known to contain many codes with best known parameters. Despite the fact that these classes of codes have been extensively searched, we have been able to refine existing search algorithms to discover many new linear codes over the alphabets $\mathbb{F}_{3}$, $\mathbb{F}_{11}$, and $\mathbb{F}_{13}$ with better parameters. A total of 38 new linear codes over the three alphabets are presented.