常循环码的迹表示.pdf

J. Appl. Math. Comput. (2015) 47:487–506 DOI 10.1007/s12190-014-0787-0 ORIGINAL RESEARCH Note on quasi-twisted codes and an application Jian Gao · Fang-Wei Fu Received: 29 March 2014 / Published online: 5 June 2014 © Korean Society for Computational and Applied Mathematics 2014 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 investi- gate some other useful properties of λ-QT codes over finite fields, including the lower Hamming distance bounds, enumerations and searching algorithm for generators. As an interesting application of λ-QT codes over finite fields, we study λ-QT codes over the finite non-chain ring Fq + vFq briefly. Keywords Constacyclic codes · Quasi-twisted codes · Minimum Hamming distance · Finite non-chain ring Mathematics Subject Classification 94B05 · 94B15 1 Introduction Quasi-twisted (QT) codes form an important class of linear codes. They can be viewed as the generalization of quasi-cyclic (QC) codes and constacyclic codes. The moti- vations of researching QT codes includes that they have good algebra structures and they can produce many record breakers in short lengths [ 1,4,7,8]. The paper [10], which is an interesting generalization of the work in [ 11], investigates some structural properties of QT codes over finite fields. The author uses the Chinese reminder theo- rem to decompose a QT code to a direct sum of component codes. Furthermore, the J. Gao ( ) · F.-W. Fu B Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, China e-mail: jiangao@mail.nankai.edu.cn F.-W. Fu e-mail: fwfu@nankai.edu.cn 123 488 J. Ga