P. Santini, Massimo Battaglioni, F. Chiaraluce, M. Baldi, Edoardo Persichetti
{"title":"低李密度奇偶校验码","authors":"P. Santini, Massimo Battaglioni, F. Chiaraluce, M. Baldi, Edoardo Persichetti","doi":"10.1109/ICC40277.2020.9148812","DOIUrl":null,"url":null,"abstract":"We introduce a new family of linear block codes over $\\mathbb{Z}_{q}$ that we name low-Lee-density parity-check (LLDPC) codes. These codes, which are embedded with the Lee metric, are characterized by a parity-check matrix whose rows and columns have low Lee weight. We propose general constructions of LLDPC codes and devise an efficient iterative decoding algorithm for them, with complexity that grows linearly with the code length. We assess the error rate performance of these codes through numerical simulations.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Low-Lee-Density Parity-Check Codes\",\"authors\":\"P. Santini, Massimo Battaglioni, F. Chiaraluce, M. Baldi, Edoardo Persichetti\",\"doi\":\"10.1109/ICC40277.2020.9148812\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new family of linear block codes over $\\\\mathbb{Z}_{q}$ that we name low-Lee-density parity-check (LLDPC) codes. These codes, which are embedded with the Lee metric, are characterized by a parity-check matrix whose rows and columns have low Lee weight. We propose general constructions of LLDPC codes and devise an efficient iterative decoding algorithm for them, with complexity that grows linearly with the code length. We assess the error rate performance of these codes through numerical simulations.\",\"PeriodicalId\":106560,\"journal\":{\"name\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"volume\":\"155 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC40277.2020.9148812\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9148812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce a new family of linear block codes over $\mathbb{Z}_{q}$ that we name low-Lee-density parity-check (LLDPC) codes. These codes, which are embedded with the Lee metric, are characterized by a parity-check matrix whose rows and columns have low Lee weight. We propose general constructions of LLDPC codes and devise an efficient iterative decoding algorithm for them, with complexity that grows linearly with the code length. We assess the error rate performance of these codes through numerical simulations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
