On the rank distance of cyclic codes

We study the rank-distance of primitive length (n=q/sup m/-1) linear cyclic codes over F/sub q//sup m/ using the discrete Fourier transform (DFT) description of these codes.