English
Related papers

Related papers: Doubly-Irregular Repeat-Accumulate Codes over Inte…

200 papers

This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary Low-Density Parity-Check codes. More precisely, a proof is provided that Voronoi constellations of LDA lattices achieve…

Information Theory · Computer Science 2016-03-10 Nicola di Pietro , Gilles Zémor , Joseph J. Boutros

This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side…

Information Theory · Computer Science 2013-08-23 Hao Yu , Michael J. Neely

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

One of the challenges often faced with wireless communication systems is its limited range and data-rate. Distributed Transmit Beamforming (DTB) techniques are being developed to address these two issues to provide reliable connectivity…

Signal Processing · Electrical Eng. & Systems 2018-07-18 Ismail Shakeel , Ishtiaq Ahmad , Hajime Suzuki

The new 5G communications standard increases data rates and supports low-latency communication that places constraints on the computational complexity of channel decoders. 5G low-density parity-check (LDPC) codes have the so-called…

Signal Processing · Electrical Eng. & Systems 2019-12-05 Maximilian Stark , Linfang Wang , Richard D. Wesel , Gerhard Bauch

We study LDPC codes for the channel with $2^m$-ary input $\underline{x}\in \mathbb{F}_2^m$ and output $\underline{y}=\underline{x}+\underline{z}\in \mathbb{F}_2^m$. The receiver knows a subspace $V\subset \mathbb{F}_2^m$ from which…

Information Theory · Computer Science 2012-05-22 Kenta Kasai , Takayuki Nozaki , Kohichi Sakaniwa

This paper studies the capacity of the two-user intensity-modulation/direct-detection (IM/DD) interference channel (IC), which is relevant in the context of multi-user optical wireless communications. Despite some known single-letter…

Information Theory · Computer Science 2022-07-05 Zhenyu Zhang , Anas Chaaban

This work considers the smart repeater network where a single source $s$ wants to send two independent packet streams to destinations $\{d_1,d_2\}$ with the help of relay $r$. The transmission from $s$ or $r$ is modeled by packet erasure…

Information Theory · Computer Science 2016-05-05 Jaemin Han , Chih-Chun Wang

This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error…

Information Theory · Computer Science 2007-07-13 I. Sason , I. Goldenberg

Motivated by recently derived fundamental limits on total (transmit + decoding) power for coded communication with VLSI decoders, this paper investigates the scaling behavior of the minimum total power needed to communicate over AWGN…

Information Theory · Computer Science 2018-04-02 Karthik Ganesan , Pulkit Grover , Jan Rabaey , Andrea Goldsmith

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. In contrast to the standard approach in the literature which employs random…

Information Theory · Computer Science 2015-01-28 Laura Luzzi , Roope Vehkalahti

A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The…

Information Theory · Computer Science 2010-01-22 Hamidreza Ebrahimzadeh Saffar , Patrick Mitran

In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA…

Information Theory · Computer Science 2025-05-27 V. Arvind Rameshwar , V. Lalitha

Integer Forcing (IF) is a novel linear receiver architecture, where instead of separating the codewords sent by each transmitter, and decoding them individually, forces integer-valued linear combinations at each receive antenna, and decodes…

Information Theory · Computer Science 2017-10-03 Ron Meiry , Omer Gurewitz , Asaf Cohen

We consider a communication system where two transmitters wish to exchange information through a half-duplex relay in the middle. The channels between the transmitters and the relay have asymmetric channel gains. More specifically, the…

Information Theory · Computer Science 2009-08-18 Makesh Pravin Wilson , Krishna Narayanan

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…

Information Theory · Computer Science 2025-01-09 Jiajie Xue , Brian M. Kurkoski

Reconfigurable intelligent surface (RIS) is promising for future 6G wireless communications. However, the increased number of RIS elements results in the high overhead for channel acquisition and the non-negligible power consumption.…

Information Theory · Computer Science 2023-01-16 Ruochen Su , Linglong Dai , Jingbo Tan , Mo Hao , Richard MacKenzie

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

Information Theory · Computer Science 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

Departing from traditional communication theory where decoding algorithms are assumed to perform without error, a system where noise perturbs both computational devices and communication channels is considered here. This paper studies…

Information Theory · Computer Science 2010-05-31 Lav R. Varshney