ABSTRACT
A universal optimization method able to efficiently solve any optimization problem does not yet exist. It is with our judgement that we select or develop the appropriate algorithm that best fits our problem. A communication sequence for an NCS has a finite discrete structure. Finding an optimal sequence is a complex combinatorial problem. However, our a priory knowledge about the search space can help simplifying this task.
