On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences.
Moubariz Z. GaraevFlorian LucaIgor E. ShparlinskiArne WinterhofPublished in: IEEE Trans. Inf. Theory (2006)
Keyphrases
- linear complexity
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- linear computational complexity
- upper and lower bounds
- worst case
- optimal solution
- objective function
- np hard
- hidden markov models
- sufficiently accurate
- sequential patterns
- sample complexity
- lower bounding
- long sequences
- variable length
- linear programming relaxation
- computational complexity
- constant factor
- data sets