栅格信道码族误差指数边界的直接几何方法

Proceedings of 1994 IEEE International Symposium on Information Theory Pub Date : 1994-06-27 DOI:10.1109/ISIT.1994.394986

V. Šenk, D. Lazic, D. Drajic

{"title":"栅格信道码族误差指数边界的直接几何方法","authors":"V. Šenk, D. Lazic, D. Drajic","doi":"10.1109/ISIT.1994.394986","DOIUrl":null,"url":null,"abstract":"Noting that a trellis code is a union of sub-block codes of different length, the error exponent of the families of trellis codes with known distance distribution of its sub-block codes is determined. The approach allows the analysis of the effect of memory length and of parallel transitions.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A direct geometrical method for bounding the error exponent for families of trellis channel codes\",\"authors\":\"V. Šenk, D. Lazic, D. Drajic\",\"doi\":\"10.1109/ISIT.1994.394986\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Noting that a trellis code is a union of sub-block codes of different length, the error exponent of the families of trellis codes with known distance distribution of its sub-block codes is determined. The approach allows the analysis of the effect of memory length and of parallel transitions.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394986\",\"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 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394986","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

注意到格码是不同长度的子块码的并集，确定其子块码距离分布已知的格码族的误差指数。该方法允许分析记忆长度和并行转换的影响。

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

查看原文本刊更多论文

A direct geometrical method for bounding the error exponent for families of trellis channel codes

Noting that a trellis code is a union of sub-block codes of different length, the error exponent of the families of trellis codes with known distance distribution of its sub-block codes is determined. The approach allows the analysis of the effect of memory length and of parallel transitions.<>

求助全文

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

来源期刊

Proceedings of 1994 IEEE International Symposium on Information Theory

自引率

0.00%

发文量