Efficient exhaustive search for binary complementary code sets.

Gregory Emmett Coxson Jon Carmelo Russo

Published in: CISS (2013)

Keyphrases

exhaustive search
computational complexity
dynamic programming
brute force
computationally feasible
lightweight
nearest neighbor search
solution space
computationally efficient
search methods
multi class
search space
neural network
cost effective
simulated annealing
nearest neighbor
case study