Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4583161 | Finite Fields and Their Applications | 2012 | 21 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory