Towards Efficient Decoding Algorithm of q-Ary Codes from Lattice
Linear code, a foundational construct extensively employed in communication, data transmission, and error correction, has been the subject of rigorous study for decades. Despite significant academic successes and widespread adoption, recent studies show that decoding methods for general linear codes...
Uložené v:
| Vydané v: | International Conference on Mobile Ad-Hoc and Sensor Networks s. 577 - 584 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
20.12.2024
|
| Predmet: | |
| ISSN: | 2994-3523 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Linear code, a foundational construct extensively employed in communication, data transmission, and error correction, has been the subject of rigorous study for decades. Despite significant academic successes and widespread adoption, recent studies show that decoding methods for general linear codes, such as syndrome decoding, require the storage and search of large decoding tables, leading to inefficiencies. To mitigate this, Debris-Alazard et al. first proposed adapting Babai's algorithm and the LLL algorithm from lattice theory to binary codes, achieving considerable performance gains. Inspired by this, in this paper, we aim to explore the design of more general linear codes to overcome the limitations of baseline binary codes and enhance their applicability in more advanced applications such as DNA storage and 5G communication systems. To address this gap, we extend the foundational domain and decoding algorithms from lattices to q-ary codes. Specifically, we define a new fundamental domain and propose a polynomial-time decoding algorithm, RedtoFun. To validate our findings, we conduct a series of experiments to evaluate its real-world performance. The results demonstrate that our optimized RedtoFun algorithm surpasses the syndrome decoding scheme in terms of memory overhead and runtime while maintaining performance on par with the SizeRed decoding scheme. |
|---|---|
| AbstractList | Linear code, a foundational construct extensively employed in communication, data transmission, and error correction, has been the subject of rigorous study for decades. Despite significant academic successes and widespread adoption, recent studies show that decoding methods for general linear codes, such as syndrome decoding, require the storage and search of large decoding tables, leading to inefficiencies. To mitigate this, Debris-Alazard et al. first proposed adapting Babai's algorithm and the LLL algorithm from lattice theory to binary codes, achieving considerable performance gains. Inspired by this, in this paper, we aim to explore the design of more general linear codes to overcome the limitations of baseline binary codes and enhance their applicability in more advanced applications such as DNA storage and 5G communication systems. To address this gap, we extend the foundational domain and decoding algorithms from lattices to q-ary codes. Specifically, we define a new fundamental domain and propose a polynomial-time decoding algorithm, RedtoFun. To validate our findings, we conduct a series of experiments to evaluate its real-world performance. The results demonstrate that our optimized RedtoFun algorithm surpasses the syndrome decoding scheme in terms of memory overhead and runtime while maintaining performance on par with the SizeRed decoding scheme. |
| Author | Zhao, Wei Xu, Lei Liu, Jianghua Xu, Chungen Zhang, Xiaojun Ding, Yanzhang |
| Author_xml | – sequence: 1 givenname: Xiaojun surname: Zhang fullname: Zhang, Xiaojun email: zhangxiaojun@njust.edu.cn organization: Nanjing University of Science and Technology,Nanjing,China,210094 – sequence: 2 givenname: Wei surname: Zhao fullname: Zhao, Wei email: zhaowei9801@163.com organization: National Key Laboratory of Security Communication,Chengdu,China,610041 – sequence: 3 givenname: Lei surname: Xu fullname: Xu, Lei email: leixu@njust.edu.cn organization: Nanjing University of Science and Technology,Nanjing,China,210094 – sequence: 4 givenname: Yanzhang surname: Ding fullname: Ding, Yanzhang email: dingyanzhang@njust.edu.cn organization: Nanjing University of Science and Technology,Nanjing,China,210094 – sequence: 5 givenname: Jianghua surname: Liu fullname: Liu, Jianghua email: jhliu@njust.edu.cn organization: Nanjing University of Science and Technology,Nanjing,China,210094 – sequence: 6 givenname: Chungen surname: Xu fullname: Xu, Chungen email: xuchung@njust.edu.cn organization: Nanjing University of Science and Technology,Nanjing,China,210094 |
| BookMark | eNotkM1KxDAUhaMoOI59Al3kBVqT3DbN3VnG8QeqLux-aNObMTJtNC3IvL0FXR34OHwcziU7G8NIjF1LkUkp8Pbl_VVDoctMCZVnQgiTn7AESzQAspB6oadspRDzFAoFFyyZps-lBkKgRLFid034aWM_8a1z3noaZ35PNvR-3PPqsA_Rzx8DD45_p1U88k3oaeIuhoHX7Tx7S1fs3LWHiZL_XLPmYdtsntL67fF5U9Wpl6WZUwDrSFInZUcWbFuiBJ33GgyiLTrUVi2LDJa9EaogBJcDgDYtmkL1Etbs5k_riWj3Ff3QxuNu-WCxKAG_L8xKeA |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/MSN63567.2024.00084 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9798331516024 |
| EISSN | 2994-3523 |
| EndPage | 584 |
| ExternalDocumentID | 11036420 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IM 6IN AAJGR ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI OCL RIE RIL RNS |
| ID | FETCH-LOGICAL-i178t-33cfe1eb11bec3ca791364d63899c5b96c2091897d8025e93f433368a9852d13 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001540152200073&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 01:40:38 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i178t-33cfe1eb11bec3ca791364d63899c5b96c2091897d8025e93f433368a9852d13 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_11036420 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Dec.-20 |
| PublicationDateYYYYMMDD | 2024-12-20 |
| PublicationDate_xml | – month: 12 year: 2024 text: 2024-Dec.-20 day: 20 |
| PublicationDecade | 2020 |
| PublicationTitle | International Conference on Mobile Ad-Hoc and Sensor Networks |
| PublicationTitleAbbrev | MSN |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0003009190 |
| Score | 1.8932834 |
| Snippet | Linear code, a foundational construct extensively employed in communication, data transmission, and error correction, has been the subject of rigorous study... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 577 |
| SubjectTerms | Babai's algorithm Binary codes Decoding decoding algorithm Generators Lattices Linear code Linear codes Memory management Performance gain q-ary codes Runtime Sensors Vectors |
| Title | Towards Efficient Decoding Algorithm of q-Ary Codes from Lattice |
| URI | https://ieeexplore.ieee.org/document/11036420 |
| WOSCitedRecordID | wos001540152200073&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwMhECXaeNCLXzV-h4NX7ALbBW42tY2H2jSxh94alp3VJtrV3a2J_96B1taLB2-EECAzCfMG5j0IuUls7GJEbcy6XLLYWMPSJIoZKFBGaHA8DSKuAzUc6snEjFZk9cCFAYBQfAa3vhne8rPCLfxVWQtDlUS8jBn6tlLJkqy1vlCRiBYwuq2UhXhkWo9PQ6--pjALFF4jeylhuvlDJYSQ_v4_Fz8gzQ0Zj47WYeaQbMH8iOz90hE8JnfjUPxa0V4QhMB56D2mlX487bw-F-WsfnmjRU4_WKf8ot0ig4p6Ygkd2NpXvzXJuN8bdx_Y6msENuNK10xKlwPHc5ajD6SzynDcXObhh3Ht1CROoDW0UZlGUANG5rGUMtHW6LbIuDwhjXkxh1NCTSpM7rhILEInSCNtMw0iTyGyudYSzkjT22L6vhS_mP6Y4fyP_guy683tKz5EdEkadbmAK7LjPutZVV4Hl30D3huWIg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8MgFCZmmqgXf834Ww5ecQW6Fm4uc8uMXbPEHXZbKH3VJbpq15n43_vo5ubFgycIIUAeCe978L4PQm4C41sfURszNpPM10azJPB8BiGEWiiwPKlEXKMwjtVopAdLsnrFhQGAKvkMbl21estPczt3V2UNdFUS8TJG6JtNH8sFXWt1pSIRL6B_W2oLcU83-k-x018LMQ4UTiV7IWK6_kWlciLdvX9Ov0_qazoeHawczQHZgOkh2f2lJHhE7oZV-uuMdipJCByH3mNg6frT1utzXkzKlzeaZ_SDtYov2s5TmFFHLaGRKV3-W50Mu51hu8eWnyOwCQ9VyaS0GXA8aTnugrQm1BwXlzoAom0z0YEVaA2lw1QhrAEtM19KGSijVVOkXB6T2jSfwgmhOhE6s1wEBsETJJ4yqQKRJeCZTCkJp6TubDF-X8hfjH_McPZH-zXZ7g370Th6iB_PyY4zvcv_EN4FqZXFHC7Jlv0sJ7Piqtq-b-DImWk |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Mobile+Ad-Hoc+and+Sensor+Networks&rft.atitle=Towards+Efficient+Decoding+Algorithm+of+q-Ary+Codes+from+Lattice&rft.au=Zhang%2C+Xiaojun&rft.au=Zhao%2C+Wei&rft.au=Xu%2C+Lei&rft.au=Ding%2C+Yanzhang&rft.date=2024-12-20&rft.pub=IEEE&rft.eissn=2994-3523&rft.spage=577&rft.epage=584&rft_id=info:doi/10.1109%2FMSN63567.2024.00084&rft.externalDocID=11036420 |