Details:

Title	DFT Domain Characterization of Quasi-Cyclic Codes
Author(s)	Bikash Kumar Dey, Bikash Sundar Rajan
Text	B. K. Dey and B. Sundar Rajan, DFT Domain Characterization of Quasi-Cyclic Codes, Submitted to IEEE Trans. Inform. Theory.
Type	Technical Report, Misc
Abstract	The transform domain characterization of linear cyclic codes over finite fields using Discrete Fourier Transform (DFT) over an appropriate extension field is well known. In this paper, we extend this transform domain characterization for linear quasi-cyclic codes over finite fields. We show how one can derive a lower bound on the minimum Hamming distance of a quasicyclic code and decode the code upto that minimum Hamming distance using this characterization.
Keywords	Quasi-cyclic codes, Discrete Fourier transform, Cyclotomic cosets
File
Language	English
Journal	Applicable Algebra in Engineering, Communication and Computing
Volume	13
Pages	453 - 474
Publisher	Springer Verlag
Year	2003
Edition	0
Translation	No
Refereed	No