{"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}
引用次数: 11
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).