ABSTRACT
Pseudonoise (PN) sequences, also referred to as pseudorandom sequences, are sequences that are deterministically generated and yet possess some properties that one would expect to find in randomly generated sequences. Applications of PN sequences include signal synchronization, navigation, radar ranging, random number generation, spread-spectrum communications, multipath resolution, cryptography, and signal identification in multiple-access communication systems. The Gold and Kasami families of sequences are closely related to binary linear cyclic codes. It is known in coding theory, that there exists a nonlinear binary code the performance of which exceeds that of the best-possible linear code. In 1999, Kirilusha and Narayanaswamy made the interesting observation that when one started with a sequence from a family with asymptotic merit factor 6 and appended the initial part of the sequence to the sequence, the resultant sequence was found through numerical experiments, to often have a merit factor strictly greater than 6.
