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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
