English
Related papers

Related papers: Generalized Sparse Regression Codes for Short Bloc…

200 papers

Motivated by hyper-reliable low-latency communication in 6G, we consider error control coding for short block lengths in multi-antenna fading channels. In general, the channel fading coefficients are unknown at both the transmitter and…

Signal Processing · Electrical Eng. & Systems 2025-05-13 Sai Dinesh Kancharana , Madhusudan Kumar Sinha , Arun Pachai Kannu

We study sparse regression codes (SPARC) for multiple access channels with multiple receive antennas, in non-coherent flat fading channels. We propose a novel practical decoder, referred to as maximum likelihood matching pursuit (MLMP),…

Signal Processing · Electrical Eng. & Systems 2025-07-16 V S V Sandeep , Sai Dinesh Kancharana , Arun Pachai Kannu

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 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

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

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

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

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

Inspired by compressive sensing principles, we propose novel error control coding techniques for communication systems. The information bits are encoded in the support and the non-zero entries of a sparse signal. By selecting a dictionary…

Information Theory · Computer Science 2021-02-09 Madhusudan Kumar Sinha , Arun Pachai Kannu

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

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

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

In this paper, we study a concatenate coding scheme based on sparse regression code (SPARC) and tree code for unsourced random access in massive multiple-input and multiple-output systems. Our focus is concentrated on efficient decoding for…

Information Theory · Computer Science 2022-08-15 Juntao You , Wenjie Wang , Shansuo Liang , Wei Han , Bo Bai

In this paper, utilizing techniques in compressed sensing, parallel optimization and deep learning, we propose a model-driven approach to jointly design the common measurement matrix and GROUP LASSO-based jointly sparse signal recovery…

Information Theory · Computer Science 2020-02-10 Shuaichao Li , Wanqing Zhang , Ying Cui

Secret key agreement from correlated physical layer observations is a cornerstone of information-theoretic security. This paper proposes and rigorously analyzes a complete, constructive protocol for secret key agreement from Gaussian…

Information Theory · Computer Science 2025-07-29 Emmanouil M. Athanasakos , Hariprasad Manjunath

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

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

This paper presents a semantic-enhanced receiver framework for transmitting natural language sentences over noisy wireless channels using multiple short block codes. After ASCII encoding, the sentence is divided into segments, each…

Information Theory · Computer Science 2026-04-30 Jiafu Hao , Chentao Yue , Wanchun Liu , Branka Vucetic , Yonghui Li

Retrieval over large codebases is a key component of modern LLM-based software engineering systems. Existing approaches predominantly rely on dense embedding models, while learned sparse retrieval (LSR) remains largely unexplored for code.…

Information Retrieval · Computer Science 2026-03-24 Simon Lupart , Maxime Louis , Thibault Formal , Hervé Déjean , Stéphane Clinchant

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
‹ Prev 1 2 3 10 Next ›