{"title":"广义超码译码","authors":"A. Abramov, E. Krouk","doi":"10.1109/RED.2014.7016692","DOIUrl":null,"url":null,"abstract":"Decoding random linear codes is one of the central problems in coding theory and code-based cryptography. In this paper a generalized supercodes decoding algorithm is proposed. The idea of the new algorithm is to keep a list of candidate vectors having an exponential size instead of tending to zero size as it was organized in the original algorithm proposed by Barg, Krouk and van Tilborg.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized supercodes decoding\",\"authors\":\"A. Abramov, E. Krouk\",\"doi\":\"10.1109/RED.2014.7016692\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Decoding random linear codes is one of the central problems in coding theory and code-based cryptography. In this paper a generalized supercodes decoding algorithm is proposed. The idea of the new algorithm is to keep a list of candidate vectors having an exponential size instead of tending to zero size as it was organized in the original algorithm proposed by Barg, Krouk and van Tilborg.\",\"PeriodicalId\":270689,\"journal\":{\"name\":\"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RED.2014.7016692\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2014.7016692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Decoding random linear codes is one of the central problems in coding theory and code-based cryptography. In this paper a generalized supercodes decoding algorithm is proposed. The idea of the new algorithm is to keep a list of candidate vectors having an exponential size instead of tending to zero size as it was organized in the original algorithm proposed by Barg, Krouk and van Tilborg.