scientific article; zbMATH DE number 1024087

zbMath0872.94030MaRDI QIDQ4341781

Pino Caballero-Gil, Amparo Fúster-Sabater

Publication date: 18 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear complexitymaximal-length LFSRnonlinearly filtered PN-sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (6)

On the linear complexity of the sequences generated by nonlinear filterings ⋮ On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators ⋮ Characteristic digit-sum sequences ⋮ Linear Span analysis of a set of periodic sequence generators ⋮ A wide family of nonlinear filter functions with a large linear span ⋮ New upper bounds on the linear complexity

This page was built for publication: