{"title":"Efficient exhaustive search for binary complementary code sets","authors":"G. Coxson, J. Russo","doi":"10.1109/CISS.2013.6552317","DOIUrl":null,"url":null,"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.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2013.6552317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
