Finite Dimensional Lattice Codes With Self Error-Detection and Retry Decoding

Lattice codes with the optimal decoding coefficient are capacity-achieving when dimension N → ∞. In communications systems, finite dimensional lattice codes are needed, where the optimal decoding coefficient may still fail decoding even when R < C. This paper presents a new retry decoding scheme for finite dimensional lattice-based transmissions. When decoding errors are detected, the receiver is allowed to adjust the value of decoding coefficients and retry decoding, instead of requesting a retransmission immediately which causes high latency. This scheme is considered for both point-to-point single user transmission and compute-forward (CF) relaying with power unconstrained relays, by which a lower word error rate (WER) is achieved than conventional one-shot decoding with optimal coefficients. A lattice/lattice code construction, called CRC-embedded lattice/lattice code, is presented to provide physical layer error detection to enable retry decoding. For CF relaying, a lattice code design is given so that the decoder is able to detect errors from CF linear combinations without requiring individual users’ messages. The numerical results show gains of up to 1.31 dB and 1.08 dB at error probability 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">−5</sup> for a 2-user CF relay using 128- and 256-dimensional lattice codes with optimized CRC length and 2 decoding trials in total.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-04-14
DOI
https://doi.org/10.1109/tcomm.2025.3560348
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finite Dimensional Lattice Codes With Self Error-Detection and Retry Decoding

Brian M. Kurkoski, Jiajie Xue
IEEE Transactions on Communications
Coding theory and cryptography
article

Finite Dimensional Lattice Codes With Self Error-Detection and Retry Decoding

Brian M. Kurkoski, Jiajie Xue
article en

Abstract

Lattice codes with the optimal decoding coefficient are capacity-achieving when dimension N → ∞. In communications systems, finite dimensional lattice codes are needed, where the optimal decoding coefficient may still fail decoding even when R < C. This paper presents a new retry decoding scheme for finite dimensional lattice-based transmissions. When decoding errors are detected, the receiver is allowed to adjust the value of decoding coefficients and retry decoding, instead of requesting a retransmission immediately which causes high latency. This scheme is considered for both point-to-point single user transmission and compute-forward (CF) relaying with power unconstrained relays, by which a lower word error rate (WER) is achieved than conventional one-shot decoding with optimal coefficients. A lattice/lattice code construction, called CRC-embedded lattice/lattice code, is presented to provide physical layer error detection to enable retry decoding. For CF relaying, a lattice code design is given so that the decoder is able to detect errors from CF linear combinations without requiring individual users’ messages. The numerical results show gains of up to 1.31 dB and 1.08 dB at error probability 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">−5</sup> for a 2-user CF relay using 128- and 256-dimensional lattice codes with optimized CRC length and 2 decoding trials in total.

IEEE Transactions on CommunicationsVol. 73(10)
Japan Advanced Institute of Science and Technology (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 97%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.