卷积码中权重枚举数的计算

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2003-04-22 DOI:10.1109/ISIT.2000.866326

C. Pimentel

{"title":"卷积码中权重枚举数的计算","authors":"C. Pimentel","doi":"10.1109/ISIT.2000.866326","DOIUrl":null,"url":null,"abstract":"Performance bounds for maximum likelihood decoding of convolutional codes over memoryless channels are commonly measured using the first few terms of the series expansion of the transfer function T(x,y). In this paper we present an efficient algebraic method to obtain this truncated series without first computing the complete T(x,y).","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On the computation of weight enumerators for convolutional codes\",\"authors\":\"C. Pimentel\",\"doi\":\"10.1109/ISIT.2000.866326\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Performance bounds for maximum likelihood decoding of convolutional codes over memoryless channels are commonly measured using the first few terms of the series expansion of the transfer function T(x,y). In this paper we present an efficient algebraic method to obtain this truncated series without first computing the complete T(x,y).\",\"PeriodicalId\":108752,\"journal\":{\"name\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2000.866326\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2000.866326","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

卷积码在无内存信道上的最大似然解码的性能界限通常使用传递函数T(x,y)的级数展开的前几项来测量。本文给出了一种不用计算T(x,y)的完整序列就能得到这种截断级数的有效代数方法。

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

查看原文本刊更多论文

On the computation of weight enumerators for convolutional codes

Performance bounds for maximum likelihood decoding of convolutional codes over memoryless channels are commonly measured using the first few terms of the series expansion of the transfer function T(x,y). In this paper we present an efficient algebraic method to obtain this truncated series without first computing the complete T(x,y).

求助全文

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

来源期刊

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)

自引率

0.00%

发文量