Title :
Efficient exhaustive search for binary complementary code sets
Author :
Coxson, Gregory E. ; Russo, Jon C.
Abstract :
Binary complementary code sets offer a possibility that single binary codes cannot-zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight needed for developing an efficient exhaustive search for complementary code sets. An exhaustive search approach is described, designed to find all sets of K complementary binary codes of length N, for specified N and K. Results for several cases are examined.
Keywords :
binary codes; matrix algebra; binary complementary code sets; complementary code matrices columns; efficient exhaustive search; zero aperiodic autocorrelation sidelobe level; Binary codes; Correlation; Error correction; Error correction codes; Laboratories; Radar imaging; Vectors; Hadamard matrix; autocorrelation sidelobes; binary code; complementary code set; exhaustive search;
Conference_Titel :
Information Sciences and Systems (CISS), 2013 47th Annual Conference on
Conference_Location :
Baltimore, MD
Print_ISBN :
978-1-4673-5237-6
Electronic_ISBN :
978-1-4673-5238-3
DOI :
10.1109/CISS.2013.6552317
