Cyclotomic cosets play very important roles in classical and quantum error correction theory.In order to constructing quantum BCH (Bose Chaudhuri Hocquenghem) codes with CSS constructing method from classical BCH codes
it needs to determine whether a BCH code contains its dual.It proposed several properties of cyclotomic cosets.And according to these properties
an algorithm with polynomial time complexity was presented to determine whether a non-primitive BCH code over finite field contains its dual code
which can also be applied to nonnarrow sense primitive BCH codes.