Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices

✍ Scribed by Meega Kumari

• Book ID: 103060255
• Publisher: Elsevier Science
• Year: 1985
• Tongue: English
• Weight: 803 KB
• Volume: 56
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(85)90027-5

✦ Synopsis

that it can be applied to any level of logic and one can get the minimal generator of all possible non-linear feedforward sequences.

cY,(Y ,...,cY 2'm' be distinct roots of f in GF(2'), where o! is a root of f in GF(2'). Key has stated that the output sequences {a(n)}, n = 0, 1,2,. . . , of a linear q*v* * 9 *+ ,+