DFT Domain Characterization of Quasi-Cyclic Codes

Bikash Kumar, Dey and Sundar B, Rajan (2003) DFT Domain Characterization of Quasi-Cyclic Codes. In: Applicable Algebra in Engineering, Communication and Computing, 13 (6). pp. 453-474.

PDF DFT_domain.pdf Restricted to Registered users only Download (214kB) | Request a copy

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 quasi-cyclic code and decode the code upto that minimum Hamming distance using this characterization.

Item Type:	Journal Article
Publication:	Applicable Algebra in Engineering, Communication and Computing
Publisher:	Springer-Verlag
Additional Information:	Copyright of this article belongs to Springer-Verlag.
Keywords:	Quasi-cyclic codes;Discrete Fourier transform;Cyclotomic cosets
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:37
URI:	http://eprints.iisc.ac.in/id/eprint/10739

Actions (login required)

View Item