Related papers: Noisy Index Coding with PSK and QAM
The use of open-loop coding can be easily extended to a closed-loop concatenated code if the channel has access to feedback. This can be done by introducing a feedback transmission scheme as an inner code. In this paper, this process is…
An energy-efficient approach is presented for shaping a bit-interleaved low-density parity-check (LDPC) coded amplitude phase-shift keying (APSK) system. A subset of the interleaved bits output by a binary LDPC encoder are passed through a…
It is well known that the maximal success probability of the binary quantum communication can be improved by using a sub-Poissonian non-standard coherent state as an information carrier. In the present article, we consider the quantum…
Physical-Layer Network Coding (PNC) is an effective technique to improve the throughput and latency in wireless networks. However, there are two major challenges for PNC, especially when using higher order modulations: 1) phase…
Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy intermediate-scale quantum (NISQ) processors. Such systems leverage classical optimization to tune the parameters of a…
We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…
To communicate at the nanoscale, researchers have proposed molecular communication as an energy-efficient solution. The drawback to this solution is that the histogram of the molecules' hitting times, which constitute the molecular signal…
This paper proposes novel spectrum sensing algorithms for cognitive radio networks. By assuming known transmitter pulse shaping filter, synchronous and asynchronous receiver scenarios have been considered. For each of these scenarios, the…
Analog-to-digital conversion (ADC) is a key bottleneck in scaling DSP-centric receiver architectures to multiGigabit/s speeds. Recent information-theoretic results, obtained under ideal channel conditions (perfect synchronization, no…
In this paper, we consider the application of Reed- Solomon (RS) channel coding for joint error correction and cooperative network coding on non-binary phase shift keying (PSK) modulated signals. The relay first decodes the RS channel coded…
This paper considers the three-receiver AWGN broadcast channel where the receivers (i) have private-message requests and (ii) know some of the messages requested by other receivers as side information. For this setup, all possible side…
We study the problem of constructing good space-time codes for broadcasting $K$ independent messages over a MIMO network to $L$ users, where each user demands all the messages and already has a subset of messages as side information. As a…
A sender wishes to broadcast an n character word x in F^n (for a field F) to n receivers R_1,...,R_n. Every receiver has some side information on x consisting of a subset of the characters of x. The side information of the receivers is…
This paper investigates the problem of zero-delay joint source-channel coding of a vector Gauss-Markov source over a multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channel with feedback. In contrast to the…
We consider the problem of coding for quantum channels with side information that is available ahead of time at the transmitter but not at the receiver. We find a single-letter expression for the entanglement-assisted quantum capacity of…
We consider a worst-case asymmetric distributed source coding problem where an information sink communicates with $N$ correlated information sources to gather their data. A data-vector $\bar{x} = (x_1, ..., x_N) \sim {\mathcal P}$ is…
A single unicast index coding problem (SUICP) with symmetric and consecutive interference (SCI) has $K$ messages and $K$ receivers, the $k$th receiver $R_k$ wanting the $k$th message $x_k$ and having interference $\mathcal{I}_k=…
This paper addresses lossy transmission of a common source over a broadcast channel when there is correlated side information at the receivers, with emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme that combines…
We investigate design and performance of communications over the bandlimited Gaussian channel with one-bit output quantization. A transceiver structure is proposed, which generates the channel input using a finite set of time-limited and…