scientific article; zbMATH DE number 4191552

zbMATH Open0722.94008MaRDI QIDQ3211238FDOQ3211238

Authors: Gong Guang 

Publication date: 1990

Title of this publication is not available (Why is that?)

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.

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)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal linear equivalent analysis of a variable-memory binary sequence generator
• Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
• Nonlinearities on cryptographic shift registers
• Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
• Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
• The main-controlled generator
• Title not available (Why is that?)

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)