Konstantinos Drakakis, Francesco Iorio, S. Rickard
{"title":"顺序为28的Costas数组的枚举","authors":"Konstantinos Drakakis, Francesco Iorio, S. Rickard","doi":"10.3934/amc.2011.5.69","DOIUrl":null,"url":null,"abstract":"We present the results of the enumeration of Costas arrays of order 28: all arrays found are accounted for by the Golomb and Welch construction methods, making 28 the first order (larger than 5) for which no sporadic Costas arrays exist. The enumeration was performed on several computer clusters and required the equivalent of 70 years of single CPU time.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"The enumeration of Costas arrays of order 28\",\"authors\":\"Konstantinos Drakakis, Francesco Iorio, S. Rickard\",\"doi\":\"10.3934/amc.2011.5.69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present the results of the enumeration of Costas arrays of order 28: all arrays found are accounted for by the Golomb and Welch construction methods, making 28 the first order (larger than 5) for which no sporadic Costas arrays exist. The enumeration was performed on several computer clusters and required the equivalent of 70 years of single CPU time.\",\"PeriodicalId\":354925,\"journal\":{\"name\":\"2010 IEEE Information Theory Workshop\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3934/amc.2011.5.69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/amc.2011.5.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present the results of the enumeration of Costas arrays of order 28: all arrays found are accounted for by the Golomb and Welch construction methods, making 28 the first order (larger than 5) for which no sporadic Costas arrays exist. The enumeration was performed on several computer clusters and required the equivalent of 70 years of single CPU time.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
