41 citations · 67 across the 29 of their papers we have counts for
20 papers · 1 filter
Symplectic Barnes-Wall GKP Codes: Deterministic Decoding and Logarithmic Rate Scaling
Shanxiang Lyu
We construct an explicit symplectic realization of the Barnes-Wall lattice that yields a family of multimode Gottesman-Kitaev-Preskill (GKP) codes with encoding rate $R = \frac{1}{…
Integer-Forcing Precoding: A Geometric Perspective and Low-Complexity Algorithm Design
Junren Qin, Fan Jiang, Tao Yang +3
The joint coefficient--scaling design of integer-forcing (IF) precoding couples a full-rank integer coefficient matrix with a positive diagonal scaling matrix, resulting in a mixed…
Decoding Golay Codes and their Related Lattices: A PAC Code Perspective
Yujun Ji, Ling Liu, Shanxiang Lyu +3
In this work, we propose a decoding method of Golay codes from the perspective of Polarization Adjusted Convolutional (PAC) codes. By invoking Forney's cubing construction of Golay…
Construction of Simultaneously Good Polar Codes and Polar Lattices
Ling Liu, Ruimin Yuan, Shanxiang Lyu +2
In this work, we investigate the simultaneous goodness of polar codes and polar lattices. The simultaneous goodness of a lattice or a code means that it is optimal for both channel…
Revisit the AWGN-goodness of Polar-like Lattices
Ling Liu, Junjiang Yu, Shanxiang Lyu +1
This paper aims to provide a comprehensive introduction to lattices constructed based on polar-like codes and demonstrate some of their key properties, such as AWGN goodness. We fi…
On the quantization goodness of polar lattices
Ling Liu, Shanxiang Lyu, Cong Ling +1
In this work, we prove that polar lattices, when tailored for lossy compression, are quantization-good in the sense that their normalized second moments approach as…
Lattice-Code Multiple Access: Architecture and Efficient Algorithms
Tao Yang. Fangtao Yu, Rongke Liu, Shangxiang Lyu +1
This paper studies a -user lattice-code based multiple-access (LCMA) scheme. Each user equipment (UE) encode its message with a practical lattice code, where we suggest a -…
Lattice Codes for Lattice-Based PKE
Shanxiang Lyu, Ling Liu, Cong Ling +2
Existing error correction mechanisms in lattice-based public key encryption (PKE) rely on either naive modulation or its concatenation with error correction codes (ECC). This paper…
Generalized Singleton Type Upper Bounds
Hao Chen, Longjiang Qu, Chengju Li +2
In this paper, we give upper bounds on the sizes of list-decodable codes in the Hamming metric space from covering codes with the covering radius smaller than or equal to…
Better Lattice Quantizers Constructed from Complex Integers
Shanxiang Lyu, Zheng Wang, Cong Ling +1
This paper investigates low-dimensional quantizers from the perspective of complex lattices. We adopt Eisenstein integers and Gaussian integers to define checkerboard lattices $\ma…
Lattice-Based Minimum-Distortion Data Hiding
Jieni Lin, Junren Qin, Shanxiang Lyu +2
Lattices have been conceived as a powerful tool for data hiding. While conventional studies and applications focus on achieving the optimal robustness versus distortion tradeoff, i…
GMD-Based Hybrid Beamforming for Large Reconfigurable Intelligent Surface Assisted Millimeter-Wave Massive MIMO
Keke Ying, Zhen Gao, Shanxiang Lyu +3
Reconfigurable intelligent surface (RIS) is considered to be an energy-efficient approach to reshape the wireless environment for improved throughput. Its passive feature greatly r…
On Low-complexity Lattice Reduction Algorithms for Large-scale MIMO Detection: the Blessing of Sequential Reduction
Shanxiang Lyu, Jinming Wen, Jian Weng +1
Lattice reduction is a popular preprocessing strategy in multiple-input multiple-output (MIMO) detection. In a quest for developing a low-complexity reduction algorithm for large-s…
On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields
Christian Porter, Shanxiang Lyu, Cong Ling
In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dime…
Markov chain Monte Carlo Methods For Lattice Gaussian Sampling: Lattice Reduction and Decoding Optimization
Zheng Wang, Yang Huang, Shanxiang Lyu
Sampling from the lattice Gaussian distribution has emerged as an important problem in coding, decoding and cryptography. In this paper, lattice reduction technique is adopted to G…
Lattice Reduction over Imaginary Quadratic Fields
Shanxiang Lyu, Christian Porter, Cong Ling
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorith…
Ring Compute-and-Forward over Block-Fading Channels
Shanxiang Lyu, Antonio Campello, Cong Ling
The Compute-and-Forward protocol in quasi-static channels normally employs lattice codes based on the rational integers , Gaussian integers o…
Hybrid Vector Perturbation Precoding: The Blessing of Approximate Message Passing
Shanxiang Lyu, Cong Ling
Vector perturbation (VP) precoding is a promising technique for multiuser communication systems operating in the downlink. In this work, we introduce a hybrid framework to improve…
Boosted KZ and LLL Algorithms
Shanxiang Lyu, Cong Ling
There exist two issues among popular lattice reduction (LR) algorithms that should cause our concern. The first one is Korkine-Zolotarev (KZ) and Lenstra-Lenstra-Lovasz (LLL) algor…
Compute-and-Forward over Block-Fading Channels Using Algebraic Lattices
Shanxiang Lyu, Antonio Campello, Cong Ling +1
Previous approaches to compute-and-forward (C\&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C\&F strategy over block fading…