Construction of quasi-twisted codes and enumeration of defining polynomials
Thomas Aaron Gulliver, Vadlamudi Ch. Venkaiah · Journal of Algebra Combinatorics Discrete Structures and Applications · 2019
Let $d_{q}(n,k)$ be the maximum possible minimum Hamming distance of a linear [$n,k$] code over $\mathbb{F}_{q}$. Tables of best known linear codes exist for small fields and some results are known for larger fields. Quasi-twisted codes are constructed using $m \times m$ twistulant matrices and many of these are the best known codes. In this paper, the number of $m \times m$ twistulant matrices over $\mathbb{F}_q$ is enumerated and linear codes over $\mathbb{F}_{17}$ and $\mathbb{F}_{19}$ are constructed for $k$ up to $5$. Received: 27 June 2019 | Accepted: 20 September 2019