基于专用最大团算法的排列码设计

2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI:10.1109/MCSI.2015.54

R. Montemanni, János Barta, Derek H. Smith

{"title":"基于专用最大团算法的排列码设计","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":"{\"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}","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

摘要

近年来，由于一些实际应用的推动，排列码受到了相当大的关注。这些应用充分利用了它们对传输误差和噪声的鲁棒性。本文研究的问题是构造具有指定长度和最小汉明距离的最大可能排列码。本文从最大团的角度对这一问题进行了建模，并证明了最大团的经典分支定界方法是如何专门用于排列码的设计的。这将导致更快的技术。实验结果支持这一说法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Design of Permutation Codes via a Specialized Maximum Clique Algorithm

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)

自引率

0.00%

发文量