scientific article; zbMATH DE number 4191552

MaRDI QIDQ3211238zbMATHFDO

Authors Gong Guang

Publication date 1990

zbMATH Keywords

linear complexitylinear feedback shift registernonlinear generatorsnonlinear feedforward logicprimitive connection polynomialrandom select generator

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
• Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
• Coding and Cryptography
• On the linear complexity of nonlinearly filtered pn-sequences
• On the balancedness of nonlinear generators of binary sequences.

Cited in

(10)

• Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
• scientific article; zbMATH DE number 30327 (Why is no real title available?)
• Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
• The main-controlled generator
• scientific article; zbMATH DE number 4191551 (Why is no real title available?)
• Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
• scientific article; zbMATH DE number 4070797 (Why is no real title available?)
• Nonlinearities on cryptographic shift registers
• Minimal linear equivalent analysis of a variable-memory binary sequence generator
• scientific article; zbMATH DE number 4050837 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211238)