{"title":"Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes","authors":"Y. Berger, Yair Be’ery","doi":"10.1109/18.391268","DOIUrl":null,"url":null,"abstract":"The trellis complexity of composite-length cyclic codes (CLCC's) is addressed. We first investigate the trellis properties of concatenated and product codes in general. Known factoring of CLCC's into concatenated subcodes is thereby employed to derive upper bounds on the minimal trellis size and state-space profile. New decomposition of CLCC's into product subcodes is established and utilized to derive further upper hounds on the trellis parameters. The coordinate permutations that correspond to these bounds are exhibited. Additionally, new results on the generalized Hamming weights of CLCC's are obtained. The reduction in trellis complexity of many CLCC's leads to soft-decision decoders with relatively low complexity. >","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"20 1","pages":"1185-1191"},"PeriodicalIF":0.0000,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Inf. Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/18.391268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
The trellis complexity of composite-length cyclic codes (CLCC's) is addressed. We first investigate the trellis properties of concatenated and product codes in general. Known factoring of CLCC's into concatenated subcodes is thereby employed to derive upper bounds on the minimal trellis size and state-space profile. New decomposition of CLCC's into product subcodes is established and utilized to derive further upper hounds on the trellis parameters. The coordinate permutations that correspond to these bounds are exhibited. Additionally, new results on the generalized Hamming weights of CLCC's are obtained. The reduction in trellis complexity of many CLCC's leads to soft-decision decoders with relatively low complexity. >
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
