On quasi-twisted codes over finite fields
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....
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/96047 http://hdl.handle.net/10220/11122 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | 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. |
|---|