{"title":"Golay码的一种有效的逐符号MAP解码算法","authors":"L. Ping, K. L. Yeung","doi":"10.1109/ISIT.1998.708675","DOIUrl":null,"url":null,"abstract":"An efficient symbol-by-symbol soft-in/soft-out MAP decoding algorithm for the Golay code is presented based on the coset partitioning principle. Its application in the iterative decoding of concatenated Golay codes is examined. Its advantage in constructing short frame length concatenated codes is demonstrated.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient symbol-by-symbol MAP decoding algorithm for the Golay code\",\"authors\":\"L. Ping, K. L. Yeung\",\"doi\":\"10.1109/ISIT.1998.708675\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient symbol-by-symbol soft-in/soft-out MAP decoding algorithm for the Golay code is presented based on the coset partitioning principle. Its application in the iterative decoding of concatenated Golay codes is examined. Its advantage in constructing short frame length concatenated codes is demonstrated.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708675\",\"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. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708675","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient symbol-by-symbol MAP decoding algorithm for the Golay code
An efficient symbol-by-symbol soft-in/soft-out MAP decoding algorithm for the Golay code is presented based on the coset partitioning principle. Its application in the iterative decoding of concatenated Golay codes is examined. Its advantage in constructing short frame length concatenated codes is demonstrated.