English
Related papers

Related papers: On Lattice Sequential Decoding for The Unconstrain…

200 papers

Physical-layer network coding (PNC) is a communications paradigm that exploits overlapped transmissions to boost the throughput of wireless relay networks. A high point of PNC research was a theoretical proof that PNC that makes use of…

Networking and Internet Architecture · Computer Science 2017-08-23 Yihua Tan , Soung Chang Liew , Tao Huang

We derive upper and lower bounds for the covert capacity of Additive White Gaussian Noise channels when measuring reliability in terms of the average error probability and covertness in terms of Kullback-Leibler divergence. This…

Information Theory · Computer Science 2025-06-18 C. Bouette , L. Luzzi , M. Bloch

We investigate the Peak-Power Limited (PPL) Additive White Gaussian Noise (AWGN) channels in which the signal is band-limited, and its instantaneous power cannot exceed the power P. This model is relevant to many communication systems;…

Information Theory · Computer Science 2024-12-10 Michael Peleg , Shlomo Shamai

We revisit the Gaussian broadcast channel (GBC) and explore the rate region achieved by purely discrete inputs with treating interference as noise (TIN) decoding. Specifically, we introduce a simple scheme based on superposition coding with…

Information Theory · Computer Science 2026-04-07 Yujie Shao , Min Qiu

This paper investigates the achievable rates of an additive white Gaussian noise (AWGN) energy-harvesting (EH) channel with an infinite battery. The EH process is characterized by a sequence of blocks of harvested energy, which is known…

Information Theory · Computer Science 2017-09-05 Silas L. Fong , Vincent Y. F. Tan , Ayfer Özgür

The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for these ensembles the BDD problem is NP-hard in the worst case.…

Computational Complexity · Computer Science 2025-06-23 Shuhong Gao

This paper explores the computational complexity involved in determining the capacity of the band-limited additive colored Gaussian noise (ACGN) channel and its capacity-achieving power spectral density (p.s.d.). The study reveals that when…

Information Theory · Computer Science 2023-10-11 Holger Boche , Andrea Grigorescu , Rafael F. Schaefer , H. Vincent Poor

In this paper, we investigate an algorithm to attain additive white Gaussian noise (AWGN) performance in spectrally non-white channels, using multicarrier communications, i.e., orthogonal frequency division multiplexing (OFDM) and…

Signal Processing · Electrical Eng. & Systems 2021-09-14 Hosseinali Jamal , David W. Matolak

We propose a new polar code construction framework (i.e., selecting the frozen bit positions) for the additive white Gaussian noise (AWGN) channel, tailored to a given decoding algorithm, rather than based on the (not necessarily optimal)…

Information Theory · Computer Science 2019-01-23 Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of…

Information Theory · Computer Science 2020-08-26 Guangyue Han , Shlomo Shamai

In this paper we study the Z channel with side information non-causally available at the encoders. We use Marton encoding along with Gelfand-Pinsker random binning scheme and Chong-Motani-Garg-El Gamal (CMGE) jointly decoding to find an…

Information Theory · Computer Science 2015-06-03 Saeed Hajizadeh , Mostafa Monemizadeh

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but are also a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes…

Information Theory · Computer Science 2019-05-07 Paulo Ricardo Branco da Silva , Danilo Silva

The recent work of Sommer, Feder and Shalvi presented a new family of codes called low density lattice codes (LDLC) that can be decoded efficiently and approach the capacity of the AWGN channel. A linear time iterative decoding scheme which…

Information Theory · Computer Science 2010-03-23 Danny Bickson , Alexander T. Ihler , Danny Dolev

For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by…

Information Theory · Computer Science 2010-06-22 Andrew R Barron , Antony Joseph

We develop a new transmission scheme for additive white Gaussian noisy (AWGN) single-input single-output (SISO) channels without fading based on arithmetic Fuchsian groups. The properly discontinuous character of the action of these groups…

Information Theory · Computer Science 2014-01-24 Iván Blanco-Chacón , Dionís Remón , Camilla Hollanti , Montserrat Alsina

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar

Future wireless access networks aim to simultaneously support a large number of devices with heterogeneous service requirements, including data rates, error rates, and latencies. While achievable rate and capacity results exist for Gaussian…

Information Theory · Computer Science 2022-06-15 Pin-Hsun Lin , Shih-Chun Lin , Peng-Wei Chen , Marcel Mross , Eduard A. Jorswieck

A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…

Information Theory · Computer Science 2024-04-25 M. Yusuf Şener , Gerhard Kramer , Shlomo Shamai , Ronald Böhnke , Wen Xu

Incremental redundancy with ACK/NACK feedback produces a variable-length stop-feedback (VLSF) code constrained to have $m$ decoding times, with an ACK/NACK feedback to the transmitter at each decoding time. This paper focuses on the…

Information Theory · Computer Science 2023-02-07 Hengjie Yang , Recep Can Yavas , Victoria Kostina , Richard D. Wesel