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

DOI10.1016/0012-365X(85)90027-5zbMath0581.94022OpenAlexW2068884891MaRDI QIDQ1068791

Meena Kumari

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90027-5

zbMATH Keywords

irreducible polynomialfeedback polynomial

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Inequalities of compound and induces matrices with applications to combinatorial analysis
• Linear Recurring Sequences
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Shift-register synthesis and BCH decoding
• Generation of binary sequences with controllable complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item