Please use this identifier to cite or link to this item:
|Title:||On quasi-twisted codes over finite fields||Authors:||Jia, Yan||Keywords:||DRNTU::Science||Issue Date:||2011||Series/Report no.:||Finite fields and their applications||Abstract:||In coding theory, quasi-twisted (QT) codes form an important class of codes which has been extensively studied. We decompose a QT code to a direct sum of component codes – linear codes over rings. Furthermore, given the decomposition of a QT code, we can describe the decomposition of its dual code. We also use the generalized discrete Fourier transform to give the inverse formula for both the nonrepeated-root and repeated-root cases. Then we produce a formula which can be used to construct a QT code given the component codes.||URI:||https://hdl.handle.net/10356/96047
|DOI:||http://dx.doi.org/10.1016/j.ffa.2011.08.001||Rights:||© 2011 Elsevier Inc.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.