Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants

DOI10.1007/11863854_23MaRDI QIDQ3541929zbMATH OpenOpenAlexFDO

Authors Konstantinos Limniotis, Nicholas Kolokotronis, N. Kalouptsidis

Publication date 27 November 2008

Published in Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11863854_23

zbMATH Keywords

binary sequencesfilter functionslinear complexitylinear feedbak shift registerssymmetric functionsVandermonde determinants

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Factorization of determinants over finite fields and application in stream ciphers
• Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
• On the linear complexity of nonlinearly filtered pn-sequences
• scientific article; zbMATH DE number 1024087
• Linear span analysis of a set of periodic sequence generators

Cited in

(4)

• Factorization of determinants over finite fields and application in stream ciphers
• A new lower bound on the family complexity of Legendre sequences
• Equidistant filters based on skew ML-sequences over fields
• Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

This page was built for publication: Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants

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