Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleDFT Domain Characterization of Quasi-Cyclic Codes
Author(s) Bikash Kumar Dey, Bikash Sundar Rajan
TextB. K. Dey and B. Sundar Rajan, DFT Domain Characterization of Quasi-Cyclic Codes, Submitted to IEEE Trans. Inform. Theory.
TypeTechnical Report, Misc
AbstractThe 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.
KeywordsQuasi-cyclic codes, Discrete Fourier transform, Cyclotomic cosets
JournalApplicable Algebra in Engineering, Communication and Computing
Pages453 - 474
PublisherSpringer Verlag
Translation No
Refereed No