The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation.
Vladimir EdemskiyA. PalvinskiyPublished in: Inf. Process. Lett. (2016)
Keyphrases
- linear complexity
- fixed length
- higher order
- levels of abstraction
- dynamic programming
- higher level
- finite alphabet
- optimal control
- variable length
- optimal solution
- information systems
- linear computational complexity
- hidden markov models
- optimal design
- arbitrary length
- total length
- database
- optimal strategy
- bit string
- non stationary
- scheduling problem
- evolutionary algorithm
- feature vectors
- image sequences
- decision trees
- genetic algorithm
- neural network
- real time