Related papers: On Modulo-Sum Computation over an Erasure Multiple…
A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with messages intended…
A new interference management scheme based on integer forcing (IF) receivers is studied for the two-user multiple-input and multiple-output (MIMO) interference channel. The proposed scheme employs a message splitting method that divides…
In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an…
We analyse a communication scenario over a particular causal broadcast channel whose state depends on a modulo sum. The receivers of the broadcast receive channel state information and collaborate to determine the channel state as to decode…
We develop upper bounds on code size for an independent and identically distributed deletion and insertion channels for a given code length and target frame error probability. The bounds are obtained as a variation of a general converse…
In this paper, we characterize the decoding region of algebraic soft decoding (ASD) of Reed-Solomon (RS) codes over erasure channels and binary symmetric channel (BSC). Optimal multiplicity assignment strategies (MAS) are investigated and…
Generating radiology reports automatically reduces the workload of radiologists and helps the diagnoses of specific diseases. Many existing methods take this task as modality transfer process. However, since the key information related to…
We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be…
Conventional spatial modulation (SM) is typically considered for transmission in the downlink of small-scale MIMO systems, where a single one of a set of antenna elements (AEs) is activated for implicitly conveying extra bits. By contrast,…
We study the problem of joint information and energy transfer in a binary two-hop channel with an energy harvesting relay. We consider a finite battery size at the relay and energy loss in transmitting energy. In other words, to be able to…
We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the memoryless binary erasure channel, this coupling increases the belief propagation…
Source and channel coding over multiuser channels in which receivers have access to correlated source side information is considered. For several multiuser channel models necessary and sufficient conditions for optimal separation of the…
The important problem of weighted sum rate maximization (WSRM) in a multicellular environment is intrinsically sensitive to channel estimation errors. In this paper, we study ways to maximize the weighted sum rate in a linearly precoded…
We calculate the entanglement assisted capacity of a multimode bosonic channel with loss. As long as the efficiency of the channel is above 50%, the superdense coding effect can be used to transmit more bits than those that can be stored in…
This work focuses on the downlink communication of a multiuser MIMO system where the base station antennas and the users' receiving antennas are all active, but at each transmission, only a subset of the receive antennas is selected by the…
We give some new methods for perfect reconstruction from frame and sampling erasures in finitely many steps. By bridging an erasure set we mean replacing the erased Fourier coefficients of a function with respect to a frame by appropriate…
We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the binary erasure channel, this coupling increases the belief propagation threshold of…
In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint source-channel coding of two erasure correlated sources with transmission over…
We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission to the receiver over a packet erasure link. Each message must subsequently be decoded at the receiver within a…
This study examines multilevel channel polarization for a certain class of erasure channels that the input alphabet size is an arbitrary composite number. We derive limiting proportions of partially noiseless channels for such a class. The…