This paper is the second one in a series explaining a new search method of long alternating codes for incoherent scatter radars. The first paper explains the general idea of the method in terms of a special game of dominoes. This second paper gives an alternative mathematical formalism suitable for computer search. It consists of three rules and a mathematical analysis leading to a formula which can be used in practical search. Although the rules were originally experimental, a mathematical proof of their sufficiency is also given. The method has been used to make a complete search up to a length of 1,048,576 bits. Even longer codes have been found, the longest one known at the moment contains 4,194,304 bits. For demonstration, complete tables of 8-, 16-, 32-, and 64-bit codes and examples of 128- and 256-bit codes are presented.¿ 1997 American Geophysical Union