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 |
| id |
sg-ntu-dr.10356-96047 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-960472020-03-07T12:31:26Z On quasi-twisted codes over finite fields Jia, Yan School of Physical and Mathematical Sciences DRNTU::Science 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. 2013-07-10T07:26:43Z 2019-12-06T19:24:52Z 2013-07-10T07:26:43Z 2019-12-06T19:24:52Z 2011 2011 Journal Article https://hdl.handle.net/10356/96047 http://hdl.handle.net/10220/11122 10.1016/j.ffa.2011.08.001 en Finite fields and their applications © 2011 Elsevier Inc. |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| country |
Singapore |
| collection |
DR-NTU |
| language |
English |
| topic |
DRNTU::Science |
| spellingShingle |
DRNTU::Science Jia, Yan On quasi-twisted codes over finite fields |
| description |
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. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Jia, Yan |
| format |
Article |
| author |
Jia, Yan |
| author_sort |
Jia, Yan |
| title |
On quasi-twisted codes over finite fields |
| title_short |
On quasi-twisted codes over finite fields |
| title_full |
On quasi-twisted codes over finite fields |
| title_fullStr |
On quasi-twisted codes over finite fields |
| title_full_unstemmed |
On quasi-twisted codes over finite fields |
| title_sort |
on quasi-twisted codes over finite fields |
| publishDate |
2013 |
| url |
https://hdl.handle.net/10356/96047 http://hdl.handle.net/10220/11122 |
| _version_ |
1681044311315054592 |