This page gives the irreducible connection polynomials of the linear feedback shift-register generators of optimized PN code sets in octal form. Polynomials are taken from Table C.2 in Appendix C of the book: W.W. Peterson & E.J. Weldon, "Error-Correcting Codes", The MIT Press, Cambridge, Massachusetts, USA, 560 p., 1972.

In the case of m-sequences note that the second half of each code set is generated using the resiprocal feedback polynomials of the first half of a code set, i.e. codes having order numbers from N/2+1 to N are time-reversed resiprocals of codes having order numbers from 1 to N/2 in the code matrix (in an optimized initial-phase, of course), where N is the total number of sequences in a set.

The sets of Gold and Kasami sequences do not contain resiprocals. Codes were generated by changing the modulo-2 summation phase of several linear component code generators. A small Kasami set always contains as the last sequence the longer m-sequence from which the set was generated. Also, in the case of Gold codes of lengths 31, 63 and 127 the last two codes in a code matrix are the sequences corresponding the preferred pairs.

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix:

Feedback polynomials in the successive order of rows of the code matrix: