English
Related papers

Related papers: Techniques for improving the finite length perform…

200 papers

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a…

Information Theory · Computer Science 2019-04-24 Cynthia Rush , Ramji Venkataramanan

We consider sparse superposition codes (SPARCs) over complex AWGN channels. Such codes can be efficiently decoded by an approximate message passing (AMP) decoder, whose performance can be predicted via so-called state evolution in the…

Information Theory · Computer Science 2021-03-09 Haiwen Cao , Pascal O. Vontobel

Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords…

Information Theory · Computer Science 2017-03-14 Cynthia Rush , Adam Greig , Ramji Venkataramanan

Sparse superposition codes, also called sparse regression codes (SPARCs), are a class of codes for efficient communication over the AWGN channel at rates approaching the channel capacity. In a standard SPARC, codewords are sparse linear…

Information Theory · Computer Science 2021-06-25 Cynthia Rush , Kuan Hsieh , Ramji Venkataramanan

Belief propagation applied to iterative decoding and sparse recovery through approximate message passing (AMP) are two research areas that have seen monumental progress in recent decades. Inspired by these advances, this article introduces…

Information Theory · Computer Science 2023-01-06 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

Sparse superposition codes, or sparse regression codes, constitute a new class of codes which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are…

Information Theory · Computer Science 2018-11-12 Jean Barbier , Mohamad Dia , Nicolas Macris

This paper studies a generalization of sparse superposition codes (SPARCs) for communication over the complex additive white Gaussian noise (AWGN) channel. In a SPARC, the codebook is defined in terms of a design matrix, and each codeword…

Information Theory · Computer Science 2021-06-25 Kuan Hsieh , Ramji Venkataramanan

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via…

Information Theory · Computer Science 2024-09-10 Yuhao Liu , Yizhou Xu , Tianqi Hou

Sparse regression codes (SPARCs) are a class of codes that encode information through the superposition of columns of a randomised coding matrix. The combination with an outer non-binary low density parity check (NB-LDPC) code was recently…

Information Theory · Computer Science 2025-09-23 Alexander Fengler , Burak Çakmak , Giuseppe Caire

Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are universal, in the sense…

Information Theory · Computer Science 2020-06-05 Erdem Biyik , Jean Barbier , Mohamad Dia

In this project, the behavior of Generalized Approximate Message-Passing Decoder for BSC and Z Channel is studied using i.i.d matrices for constructing the codewords. The performance of GAMP in AWGN Channel is already evaluated in the…

Information Theory · Computer Science 2017-12-05 Alper Kose , Berke Aral Sonmez

Sparse regression codes (SPARCs) are a promising coding scheme that can approach the Shannon limit over Additive White Gaussian Noise (AWGN) channels. Previous works have proven the capacity-achieving property of SPARCs with Gaussian design…

Information Theory · Computer Science 2023-03-16 Yizhou Xu , YuHao Liu , ShanSuo Liang , Tingyi Wu , Bo Bai , Jean Barbier , TianQi Hou

We study a new class of codes for Gaussian multi-terminal source and channel coding. These codes are designed using the statistical framework of high-dimensional linear regression and are called Sparse Superposition or Sparse Regression…

Information Theory · Computer Science 2012-12-11 Ramji Venkataramanan , Sekhar Tatikonda

This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner sparse regression code (SPARC) whose respective field size and…

Information Theory · Computer Science 2024-10-28 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

Recently, a new class of codes, called sparse superposition or sparse regression codes, has been proposed for communication over the AWGN channel. It has been proven that they achieve capacity using power allocation and various forms of…

Information Theory · Computer Science 2016-03-08 Jean Barbier , Mohamad Dia , Nicolas Macris

Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this…

Information Theory · Computer Science 2019-11-05 Ramji Venkataramanan , Sekhar Tatikonda , Andrew Barron

For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. The paper [IEEE Trans. Inform.…

Information Theory · Computer Science 2012-07-11 Antony Joseph , Andrew Barron

Next-generation wireless communication systems impose much stricter requirements for transmission rate, latency, and reliability. The peak data rate of 6G networks should be no less than 1 Tb/s, which is comparable to existing long-haul…

Information Theory · Computer Science 2024-10-28 Kirill Andreev , Pavel Rybin , Alexey Frolov

Sparse superposition (SS) codes provide an efficient communication scheme over the Gaussian channel, utilizing the vector approximate message passing (VAMP) decoder for rotational invariant design matrices. Previous work has established…

Information Theory · Computer Science 2025-04-21 Yuhao Liu , Teng Fu , Jie Fan , Panpan Niu , Chaowen Deng , Zhongyi Huang

Sparse superposition codes were originally proposed as a capacity-achieving communication scheme over the gaussian channel, whose coding matrices were made of i.i.d. gaussian entries.We extend this coding scheme to more generic ensembles of…

Information Theory · Computer Science 2022-05-27 TianQi Hou , YuHao Liu , Teng Fu , Jean Barbier
‹ Prev 1 2 3 10 Next ›