Finite Dimensional Lattice Codes with Self Error-Detection and Retry Decoding
Jiajie Xue, Brian M. Kurkoski

TL;DR
This paper introduces a retry decoding scheme for finite dimensional lattice codes that detects errors and adjusts decoding coefficients to reduce latency and improve error rates in communication systems.
Contribution
It presents a novel retry decoding method with error detection and coefficient adjustment for finite dimensional lattice codes, enhancing performance over traditional one-shot decoding.
Findings
Achieves up to 1.31 dB gain at error probability 10^{-5}
Reduces word error rate compared to conventional decoding
Demonstrates effectiveness in both point-to-point and CF relaying scenarios
Abstract
Lattice codes with optimal decoding coefficient are capacity-achieving when dimension . In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail decoding even when . 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 re-transmission 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · DNA and Biological Computing · Cellular Automata and Applications
