Dihedral codes, particular cases of quasi-cyclic have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension minimum distance, in analogy with the theory BCH codes. This us construct dihedral codes prescribed distance. binary case, present examples optimal obtained by construction.