Enumeration techniques for best N-phase codes

Efficient implementation techniques for the enumeration of the best N-phase codes are proposed. These techniques allow a single program to simultaneously take advantage of all sidelobe-invariant transformations (i.e. constant and linear phase shift, reversal and conjugation). As an example of application, all Barker codes of length 16 with minimum alphabet size are determined.