In this paper

the properties of the best code are studied specifically. The results show that the best codes not only have correlation orthogonality and duality

but also their runs and weights are strictly limited. On the other hand

it is proved that a code whose head and tail satisfy certain demands is not the best code. Based on this

a new sieve is presented and an example is given to test its effectiveness.