{"title":"The Design of Permutation Codes via a Specialized Maximum Clique Algorithm","authors":"R. Montemanni, János Barta, Derek H. Smith","doi":"10.1109/MCSI.2015.54","DOIUrl":null,"url":null,"abstract":"Permutation codes have received considerable interest in recent years, motivated by some real-world applications. These applications take advantage of their robustness against transmission errors and noise. The problem addressed in this study is the construction of the largest possible permutation codes with a specified length and minimum Hamming distance. In this paper the problem is modelled in terms of maximum cliques and it is shown how a classic branch and bound method for maximum cliques can specialized for the design of permutation codes. This leads to a much faster technique. Experimental results support this claim.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCSI.2015.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Permutation codes have received considerable interest in recent years, motivated by some real-world applications. These applications take advantage of their robustness against transmission errors and noise. The problem addressed in this study is the construction of the largest possible permutation codes with a specified length and minimum Hamming distance. In this paper the problem is modelled in terms of maximum cliques and it is shown how a classic branch and bound method for maximum cliques can specialized for the design of permutation codes. This leads to a much faster technique. Experimental results support this claim.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
