From cyclic Hadamard difference sets to perfectly balanced sequences

Hadamard difference sets associated with binary sequences are very useful in digital communications. A shortcut method to simplify search complexity is discussed. Exhaustive computer search was used to determine all the inequivalent Hadamard difference sets for parameter nu < 10000 with but a few exceptions. Present study suggests no new Hadamard difference sets. A generalization to ternary sequences is also studied. A conjecture for new family of ternary sequence is presented.