解码(23,12,7)二进制Golay码

2005 Asia-Pacific Conference on Communications Pub Date : 2005-12-12 DOI:10.1109/APCC.2005.1554105

C. Chr, S. Su, Shao-Wei Wu

{"title":"解码(23,12,7)二进制Golay码","authors":"C. Chr, S. Su, Shao-Wei Wu","doi":"10.1109/APCC.2005.1554105","DOIUrl":null,"url":null,"abstract":"In this paper, an algebraic decoding method is proposed for the (23, 12, 7) binary Golay code. By applying a technique developed in Ching-lung Chr et al. (2005) the computation complexity of this decoder is much less compared with the conventional step-by-step decoding algorithm, since the variable calculations and the operations of multiplication can be reduced significantly","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Decoding the (23, 12, 7) Binary Golay Code\",\"authors\":\"C. Chr, S. Su, Shao-Wei Wu\",\"doi\":\"10.1109/APCC.2005.1554105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an algebraic decoding method is proposed for the (23, 12, 7) binary Golay code. By applying a technique developed in Ching-lung Chr et al. (2005) the computation complexity of this decoder is much less compared with the conventional step-by-step decoding algorithm, since the variable calculations and the operations of multiplication can be reduced significantly\",\"PeriodicalId\":176147,\"journal\":{\"name\":\"2005 Asia-Pacific Conference on Communications\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2005.1554105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2005.1554105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文提出了(23,12,7)二进制Golay码的代数译码方法。通过应用Ching-lung Chr等人(2005)开发的技术，该解码器的计算复杂度比传统的分步解码算法要低得多，因为变量计算和乘法运算可以显着减少

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

查看原文本刊更多论文

Decoding the (23, 12, 7) Binary Golay Code

In this paper, an algebraic decoding method is proposed for the (23, 12, 7) binary Golay code. By applying a technique developed in Ching-lung Chr et al. (2005) the computation complexity of this decoder is much less compared with the conventional step-by-step decoding algorithm, since the variable calculations and the operations of multiplication can be reduced significantly

求助全文

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

来源期刊

2005 Asia-Pacific Conference on Communications

自引率

0.00%

发文量