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...

Full description

Saved in:
Bibliographic Details
Published in:International Conference on Mobile Ad-Hoc and Sensor Networks pp. 577 - 584
Main Authors: Zhang, Xiaojun, Zhao, Wei, Xu, Lei, Ding, Yanzhang, Liu, Jianghua, Xu, Chungen
Format: Conference Proceeding
Language:English
Published: IEEE 20.12.2024
Subjects:
Babai's algorithm
Binary codes
Decoding
decoding algorithm
Generators
Lattices
Linear code
Linear codes
Memory management
Performance gain
q-ary codes
Runtime
Sensors
Vectors
ISSN:2994-3523
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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/eLvHCXMwlV09T8MwELWgYoCFryK-5YHVtI4Tf2xUpRVDqSpRoW5VEp-hEjQlTZH495zd0rIwsNlW5ERnJffOee-ZkBsE0TJTyjGZuYjFiZMsc1Izp6VNdFMaG1i-zz3V7-vRyAxWYvWghQGAQD6DW98M__JtkS_8VlkDU5VAvIwV-rZScinWWm-oCEQLmN1WzkK8aRqPT33vvqawCoy8R_bSwnRzhkpIId39f978gNQ3Yjw6WKeZQ7IF0yOy98tH8JjcDQP5dU47wRAC56H3WFb662nr7aUoJ9XrOy0c_WCt8ou2Cwtz6oUltJdWnv1WJ8NuZ9h-YKujEdiEK10xIXIHHL-zHNdA5KkyHB_Oevhh8iQzMo8wGtooqxHUgBEuFkJInRqdRJaLE1KbFlM4JRR4xlMNDlRsYpfKDDsGqzyELgLfT3dG6j4W49nS_GL8E4bzP8YvyK4Pt2d8RM1LUqvKBVyRnfyzmszL67Bk3zPflVY
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwFLRQQQIubEXs-MDVtI4TLzeq0qqINKpEhHqrsti0EjSQpkj8Pc9uablw4JRFVhI9y3nz7JkxQjcAonkqhCE8NR7xA8NJargkRvI8kE2ucsfyfQ5FFMnhUA2WYnWnhdFaO_KZvrWnbi0_L7K5nSprQKpigJehQt8MfDgu5FqrKRUGeAHy29JbiDZVo_8UWf81AXWgZ12yFyam611UXBLp7v3z9fuovpbj4cEq0RygDT09RLu_nASP0F3s6K8z3HGWEPAcfA-FpW2PW68vRTmpxm-4MPiDtMov3C5yPcNWWoLDpLL8tzqKu5243SPLzRHIhApZEcYyoyn8aSn0AssSoSh8XG4BiMqCVPHMg2hIJXIJsEYrZnzGGJeJkoGXU3aMatNiqk8Q1jSlidRGC1_5JuEpXCio8wC8MBih5hTVbSxG7wv7i9FPGM7-uH-NtntxPxyFD9HjOdqxobf8D695gWpVOdeXaCv7rCaz8sp13zcsfJid
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