{"title":"更有效的Golay码和Leech格的有界距离解码","authors":"F. Sun, H. van Tilborg","doi":"10.1109/ISIT.1994.394620","DOIUrl":null,"url":null,"abstract":"New multilevel constructions of the Leech lattice and the Golay code are presented. They are derived from Turyn's constructions and the 'holy construction' with the octacode as the glue code. Further, we show that the 'holy construction' of the Leech lattice with the octacode as the glue code is essentially different from the permuted Turyn construction, although both constructions rely on the octacode. Based on these structures, more efficient bounded-distance decoding algorithms of the Golay code and the Leech lattice are presented.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"More efficient bounded-distance decoding of the Golay code and the Leech lattice\",\"authors\":\"F. Sun, H. van Tilborg\",\"doi\":\"10.1109/ISIT.1994.394620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"New multilevel constructions of the Leech lattice and the Golay code are presented. They are derived from Turyn's constructions and the 'holy construction' with the octacode as the glue code. Further, we show that the 'holy construction' of the Leech lattice with the octacode as the glue code is essentially different from the permuted Turyn construction, although both constructions rely on the octacode. Based on these structures, more efficient bounded-distance decoding algorithms of the Golay code and the Leech lattice are presented.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"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.394620\",\"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.394620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
More efficient bounded-distance decoding of the Golay code and the Leech lattice
New multilevel constructions of the Leech lattice and the Golay code are presented. They are derived from Turyn's constructions and the 'holy construction' with the octacode as the glue code. Further, we show that the 'holy construction' of the Leech lattice with the octacode as the glue code is essentially different from the permuted Turyn construction, although both constructions rely on the octacode. Based on these structures, more efficient bounded-distance decoding algorithms of the Golay code and the Leech lattice are presented.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
