幂等卷积码自由距离的计算

Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation Pub Date : 2018-07-11 DOI:10.1145/3208976.3208985

J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro

{"title":"幂等卷积码自由距离的计算","authors":"J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro","doi":"10.1145/3208976.3208985","DOIUrl":null,"url":null,"abstract":"We show that, for cyclic convolutional codes, it is possible to compute a sequence of positive integers, called cyclic column distances, which presents a more regular behavior than the classical column distances sequence. We then design an algorithm for the computation of the free distance based on the calculation of this cyclic column distances sequence.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Computing Free Distances of Idempotent Convolutional Codes\",\"authors\":\"J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro\",\"doi\":\"10.1145/3208976.3208985\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that, for cyclic convolutional codes, it is possible to compute a sequence of positive integers, called cyclic column distances, which presents a more regular behavior than the classical column distances sequence. We then design an algorithm for the computation of the free distance based on the calculation of this cyclic column distances sequence.\",\"PeriodicalId\":105762,\"journal\":{\"name\":\"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3208976.3208985\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3208976.3208985","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们证明，对于循环卷积码，可以计算一个称为循环列距离的正整数序列，它比经典的列距离序列表现出更规则的行为。然后在此循环列距离序列计算的基础上设计了自由距离的计算算法。

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

查看原文本刊更多论文

Computing Free Distances of Idempotent Convolutional Codes

We show that, for cyclic convolutional codes, it is possible to compute a sequence of positive integers, called cyclic column distances, which presents a more regular behavior than the classical column distances sequence. We then design an algorithm for the computation of the free distance based on the calculation of this cyclic column distances sequence.

求助全文

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

来源期刊

Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation

自引率

0.00%

发文量