On relationship between proposed lower bound and shift bound for cyclic codes

For cyclic codes we proposed a new lower bound of minimum distance by discrete Fourier transform (DFT). In this paper, we will show relationships between the proposed bound and the shift bound by numerical experiments. Moreover, the computational complexity of proposed lower bound is compared with the shift bound.