On the algebraic structure of quasi-cyclic codes I : finite fields
A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a linear code over an auxiliary ring. By the use of the Chinese remainder theorem (CRT), or of the discrete Fourier transform (DFT), that ring can be decomposed into a direct p...
Saved in:
Main Authors: | Ling, San, Sole, Patrick |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/96416 http://hdl.handle.net/10220/9827 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On the algebraic structure of quasi-cyclic codes III : generator theory
by: Ling, San, et al.
Published: (2013) -
On the algebraic structure of quasi-cyclic codes II : chain rings
by: Ling, San, et al.
Published: (2013) -
On the algebraic structure of quasi-cyclic codes IV : repeated roots
by: Ling, San, et al.
Published: (2013) -
New binary linear codes from algebraic curves
by: Leung, Ka Hin, et al.
Published: (2013) -
Efficiently computing exact geodesic loops within finite steps
by: Xin, Shi-Qing, et al.
Published: (2013)