Note on quasi-twisted codes and an application

Abstract

Recently, Jia proposed the decompositions and trace representations of quasi-twisted (QT) codes over finite fields (Finite Fields Appl 18:237–257, 2012). The present paper can be viewed as a complementary part of Jia’s work. We investigate some other useful properties of \(\lambda \)-QT codes over finite fields, including the lower Hamming distance bounds, enumerations and searching algorithm for generators. As an interesting application of \(\lambda \)-QT codes over finite fields, we study \(\lambda \)-QT codes over the finite non-chain ring \(\mathbb {F}_q+v\mathbb {F}_q\) briefly.