English
Related papers

Related papers: Low-Dimensional Shaping for High-Dimensional Latti…

200 papers

In this letter we present an improved distributed video coding (DVC) scheme based on polar coding techniques. Firstly, we adapt log-likelihood ratios (LLRs) for DVC with integer implementation of a discrete cosine transform (DCT). We…

Information Theory · Computer Science 2023-01-19 Grigorii Trofimiuk , Evgeny Belyaev , Peter Trifonov

The joint design of input constellation and low-density parity-check (LDPC) codes to approach the symmetric capacity of the two-user Gaussian multiple access channel is studied. More specifically, multilevel coding is employed at each user…

Information Theory · Computer Science 2019-05-02 Alexios Balatsoukas-Stimming , Stefano Rini , Joerg Kliewer

This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading…

Information Theory · Computer Science 2025-04-16 Maryam Sadeghi , Hassan Khodaiemehr , Chen Feng

Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear…

Information Theory · Computer Science 2019-02-22 Hossein Khayami , Taraneh Eghlidos , Mohammad Reza Aref

LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one binary LDPC code as underlying code gives the well known…

Information Theory · Computer Science 2016-12-14 Hassan Khodaiemehr , Mohammad-Reza Sadeghi , Daniel Panario

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…

Information Theory · Computer Science 2016-11-18 Jingge Zhu , Michael Gastpar

A new nonlinear Rao-Nam like symmetric key encryption scheme is presented in this paper. QC-LDPC lattices that are practically implementable in high dimensions due to their low complexity encoding and decoding algorithms, are used in our…

Information Theory · Computer Science 2019-06-17 Khadijeh Bagheri , Taraneh Eghlidos , Mohammad-Reza Sadeghi , Daniel Panario

A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a…

Information Theory · Computer Science 2016-08-24 Shashank Vatedka , Navin Kashyap

To address the challenge of constructing short girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes, a novel construction framework based on vertical symmetry (VS) is proposed. Basic properties of the VS structure are presented.…

Information Theory · Computer Science 2024-04-24 Guohua Zhang , Aijing Sun , Ling Liu , Yi Fang

We propose a new low-density parity-check code construction scheme based on 2-lifts. The proposed codes have an advantage of admitting efficient hardware implementations. With the motivation of designing codes with low error floors, we…

Information Theory · Computer Science 2009-08-27 Xudong Ma , En-hui Yang

In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain…

Information Theory · Computer Science 2016-11-17 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

Low-complexity precoding {algorithms} are proposed in this work to reduce the computational complexity and improve the performance of regularized block diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO} (MU-MIMO)…

Information Theory · Computer Science 2013-04-25 Keke Zu , Rodrigo C. de Lamare , Martin Haardt

Spatial statistical analysis of multivariate volumetric data can be challenging due to scale, complexity, and occlusion. Advances in topological segmentation, feature extraction, and statistical summarization have helped overcome the…

Methodology · Statistics 2022-08-16 Tyson Neuroth , Martin Rieth , Konduri Aditya , Myoungkyu Lee , Jacqueline H Chen , Kwan-Liu Ma

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, in some applications such as data hiding in…

Information Theory · Computer Science 2021-06-15 Jieni Lin , Junren Qin , Shanxiang Lyu , Bingwen Feng , Jiabo Wang

Since the Voronoi diagram appears in many applications, the topic of improving its computational efficiency remains attractive. We propose a novel yet efficient method to compute Voronoi diagrams bounded by a given domain, i.e., the clipped…

Graphics · Computer Science 2026-02-17 Yanyang Xiao , Juan Cao , Zhonggui Chen

Spatially-coupled low-density lattice codes (LDLC) are constructed using protographs. Using Monte Carlo density evolution using single-Gaussian messages, we observe that the threshold of the spatially-coupled LDLC is within 0.22 dB of…

Information Theory · Computer Science 2011-07-26 Hironori Uchikawa , Brian M. Kurkoski , Kenta Kasai , Kohichi Sakaniwa

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual…

Information Theory · Computer Science 2016-11-18 Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic amplitude shaping (PAS) architecture, a distribution matcher (DM)…

Information Theory · Computer Science 2019-02-28 Georg Böcherer , Diego Lentner , Alessandro Cirino , Fabian Steiner

Encoding and indexing of lattice codes is generalized from self-similar lattice codes to a broader class of lattices. If coding lattice $\Lambda_{\textrm{c}}$ and shaping lattice $\Lambda_{\textrm{s}}$ satisfy $\Lambda_{\textrm{s}}…

Information Theory · Computer Science 2016-07-14 Brian M. Kurkoski
‹ Prev 1 3 4 5 6 7 10 Next ›