讨论了循环码的秩有界距离算法的计算复杂度

2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI:10.1109/IWSDA.2015.7458409

Junru Zheng, T. Kaida

{"title":"讨论了循环码的秩有界距离算法的计算复杂度","authors":"Junru Zheng, T. Kaida","doi":"10.1109/IWSDA.2015.7458409","DOIUrl":null,"url":null,"abstract":"The authors proposed an algorithm for calculation of new lower bound using the discrete Fourier transform in 2010. Afterward, we considered some algorithms to improve the original algorithm. In this paper, we discuss the computational complexity of the rank bounded distance for cyclic codes.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The computational complexity of some algorithms for the rank bounded distance on cyclic codes\",\"authors\":\"Junru Zheng, T. Kaida\",\"doi\":\"10.1109/IWSDA.2015.7458409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors proposed an algorithm for calculation of new lower bound using the discrete Fourier transform in 2010. Afterward, we considered some algorithms to improve the original algorithm. In this paper, we discuss the computational complexity of the rank bounded distance for cyclic codes.\",\"PeriodicalId\":371829,\"journal\":{\"name\":\"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA.2015.7458409\",\"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 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2015.7458409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

作者在2010年提出了一种利用离散傅里叶变换计算新下界的算法。之后，我们考虑了一些算法来改进原算法。本文讨论了循环码的秩有界距离的计算复杂度。

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

查看原文本刊更多论文

The computational complexity of some algorithms for the rank bounded distance on cyclic codes

The authors proposed an algorithm for calculation of new lower bound using the discrete Fourier transform in 2010. Afterward, we considered some algorithms to improve the original algorithm. In this paper, we discuss the computational complexity of the rank bounded distance for cyclic codes.

求助全文

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

来源期刊

2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)

自引率

0.00%

发文量