Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 47, Issue 7, Pages 2751-2760Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/18.959257
Keywords
(a plus x vertical bar b plus x vertical bar a plus x vertical bar b plus x) construction; Chinese remainder theorem (CRT); discrete Fourier transform (DFT); quasi-cyclic codes; self-dual codes; (u vertical bar u plus v) construction; (u plus v vertical bar u - v) construction
Ask authors/readers for more resources
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 product of fields. That ring decomposition in turn yields a code construction from codes of lower lengths which turns out to be in some cases the celebrated squaring and cubing constructions and in other cases the recent (u + v/u - v) and Vandermonde constructions. All binary extended quadratic residue codes of length a multiple of three are shown to be attainable by the cubing construction. Quinting and septing constructions are introduced. Other results made possible by the ring decomposition are a characterization of self-dual quasi-cyclic codes, and a trace representation that generalizes that of cyclic codes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available