Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants

DOI10.1007/11863854_23zbMath1152.94390OpenAlexW1604351949MaRDI QIDQ3541929

Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas 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 sequencessymmetric functionslinear complexityfilter functionsVandermonde determinantslinear feedbak shift registers

Mathematics Subject Classification ID

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

Related Items (2)

Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Equidistant filters based on skew ML-sequences over fields

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