On Boston bound for cyclic codes by DFT with unknown elements

The Boston bound is defined by the subset of defining set for cyclic codes. The authors proposed new simple derivation for the BCH bound, the HT bound and the shift bound, using the discrete Fourier transform (DFT) and the Blahut theorem. In this paper, we consider the Boston bound for cyclic codes by the DFT.