Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, R. Lebreton
{"title":"基于lll的交错中文剩余码译码器的概率分析","authors":"Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, R. Lebreton","doi":"10.1109/ITW55543.2023.10161639","DOIUrl":null,"url":null,"abstract":"To date, Li et al. have presented the only decoder for Interleaved Chinese Remainder (ICR) codes [1]. The core of their ICR decoder is to find a short vector in a lattice using the LLL algorithm [2]. However, their analysis of the decoding failure is partially heuristic. In this work, we present a new analysis of their LLL-based decoder that gives a proved upper bound on its decoding failure probability.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes\",\"authors\":\"Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, R. Lebreton\",\"doi\":\"10.1109/ITW55543.2023.10161639\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To date, Li et al. have presented the only decoder for Interleaved Chinese Remainder (ICR) codes [1]. The core of their ICR decoder is to find a short vector in a lattice using the LLL algorithm [2]. However, their analysis of the decoding failure is partially heuristic. In this work, we present a new analysis of their LLL-based decoder that gives a proved upper bound on its decoding failure probability.\",\"PeriodicalId\":439800,\"journal\":{\"name\":\"2023 IEEE Information Theory Workshop (ITW)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW55543.2023.10161639\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW55543.2023.10161639","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
迄今为止,Li等人已经提出了唯一的交错中文余数(Interleaved Chinese residual, ICR)码解码器[1]。他们的ICR解码器的核心是使用LLL算法在晶格中找到一个短向量[2]。然而,他们对解码失败的分析部分是启发式的。在这项工作中,我们提出了一种新的基于lll的解码器的分析,给出了其解码失败概率的证明上界。
Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes
To date, Li et al. have presented the only decoder for Interleaved Chinese Remainder (ICR) codes [1]. The core of their ICR decoder is to find a short vector in a lattice using the LLL algorithm [2]. However, their analysis of the decoding failure is partially heuristic. In this work, we present a new analysis of their LLL-based decoder that gives a proved upper bound on its decoding failure probability.