A complex-valued cyclic code using fast Fourier transform

A (N, N-d/sub min/+1) cyclic code based on the complex-valued discrete Fourier transform is proposed. Since the code length N of the code can be any positive integer and each symbol in a code word can be a complex value (consists of two real-valued symbols), the code may be more suitable for some applications, than those codes based on Galois fields. One can design an encoder structure using the existing FFT chip. Due to the cyclic structure decoding is easy in a step-by-step manner.