{"title":"一组自对偶码，在许多方面表现得象速率为1/2的随机线性码","authors":"G. Olocco, J. Tillich","doi":"10.1109/ISIT.2001.935878","DOIUrl":null,"url":null,"abstract":"We perform the analysis of the minimum distance and decoding capacity of a family of self-dual codes. These rate 1/2 codes are built with a very simple multistage construction using short base codes and interleavers as in turbo-codes. We only consider the case where the base code is an extended [8,4,4] Hamming code, though our analysis would carry over to other base codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A family of self-dual codes which behave in many respects like random linear codes of rate 1/2\",\"authors\":\"G. Olocco, J. Tillich\",\"doi\":\"10.1109/ISIT.2001.935878\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We perform the analysis of the minimum distance and decoding capacity of a family of self-dual codes. These rate 1/2 codes are built with a very simple multistage construction using short base codes and interleavers as in turbo-codes. We only consider the case where the base code is an extended [8,4,4] Hamming code, though our analysis would carry over to other base codes.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935878\",\"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. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A family of self-dual codes which behave in many respects like random linear codes of rate 1/2
We perform the analysis of the minimum distance and decoding capacity of a family of self-dual codes. These rate 1/2 codes are built with a very simple multistage construction using short base codes and interleavers as in turbo-codes. We only consider the case where the base code is an extended [8,4,4] Hamming code, though our analysis would carry over to other base codes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
