用于寻找线性分组码的最小距离的分支和切割算法

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI:10.1109/ISIT.2008.4594976

Ahmet B. Keha, T. Duman

{"title":"用于寻找线性分组码的最小距离的分支和切割算法","authors":"Ahmet B. Keha, T. Duman","doi":"10.1109/ISIT.2008.4594976","DOIUrl":null,"url":null,"abstract":"We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A branch and cut algorithm for finding the minimum distance of a linear block code\",\"authors\":\"Ahmet B. Keha, T. Duman\",\"doi\":\"10.1109/ISIT.2008.4594976\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.\",\"PeriodicalId\":194674,\"journal\":{\"name\":\"2008 IEEE International Symposium on Information Theory\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2008.4594976\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2008.4594976","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

给出了一种求二元线性纠错码最小距离的分支切断算法。给出了两种整数规划模型，并研究了它们的单约束松弛的凸壳。我们使用新的不等式作为分支-切割方案中的切割。最后，我们报告了基于低密度奇偶校验(LDPC)代码的计算结果，证明了我们的切割的有效性。

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

查看原文本刊更多论文

A branch and cut algorithm for finding the minimum distance of a linear block code

We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.

求助全文

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

来源期刊

2008 IEEE International Symposium on Information Theory

自引率

0.00%

发文量