Related papers: Efficient Decoding Algorithms for the Compute-and-…
We consider the problem of distributed joint source-channel coding of correlated Gaussian sources over a Gaussian Multiple Access Channel (GMAC). There may be side information at the decoder and/or at the encoders. First we specialize a…
Optimal decoding of bit interleaved coded modulation (BICM) MIMO-OFDM where an imperfect channel estimate is available at the receiver is investigated. First, by using a Bayesian approach involving the channel a posteriori density, we…
The performance of existing coded caching schemes is sensitive to the worst channel quality, a problem which is exacerbated when communicating over fading channels. In this paper, we address this limitation in the following manner: in…
It has recently been recognized that the wireless networks represent a fertile ground for devising communication modes based on network coding. A particularly suitable application of the network coding arises for the two--way relay…
A cross-layer design along with an optimal resource allocation framework is formulated for wireless fading networks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transport layer rates,…
This paper considers the partial decode-and-forward (PDF) strategy for the Gaussian multiple-input multiple-output (MIMO) relay channel. Unlike for the decode-and-forward (DF) strategy or point-to-point (P2P) transmission, for which…
In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including…
This paper presents a novel two-way decode-and-forward (DF) relay strategy for Orthogonal Frequency Division Multiplexing (OFDM) relay networks. This DF relay strategy employs multi-subcarrier joint channel coding to leverage frequency…
Neural-network decoders can achieve a lower logical error rate compared to conventional decoders, like minimum-weight perfect matching, when decoding the surface code. Furthermore, these decoders require no prior information about the…
We study a cloud network with M distributed receiving antennas and L users, which transmit their messages towards a centralized decoder (CD), where M>=L. We consider that the cloud network applies the Compute-and-Forward (C&F) protocol,…
In this paper, we deal with the Front Steepest Descent algorithm for multi-objective optimization. We point out that the algorithm from the literature is often incapable, by design, of spanning large portions of the Pareto front. We thus…
We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show…
In this letter, we derive the probability density function (PDF) and cumulative distribution function (CDF) of the minimum of two non-central Chi-square random variables with two degrees of freedom in terms of power series. With the help of…
This paper seeks an efficient algorithm for stochastic precoding to maximize the long-term average weighted sum rates throughout a multiple-input multiple-output (MIMO) network. Unlike many existing works that assume a particular…
A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorithm applies a matrix triangulation process on a sparse polar…
We consider a system in which two users communicate with a destination with the help of a half-duplex relay. Based on the compute-and-forward scheme, we develop and evaluate the performance of coding strategies that are of network coding…
Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing properties of error correction codes. Here, we develop variants of the union-find decoder that simplify its implementation and provide potential…
Accurate decoding of quantum error-correcting codes is a crucial ingredient in protecting quantum information from decoherence. It requires characterizing the error channels corrupting the logical quantum state and providing this…
In this work, we explore the introduction of distributed space-time codes in decode-and-forward (DF) protocols. A first protocol named the Asymmetric DF is presented. It is based on two phases of different lengths, defined so that signals…
The compute-and-forward (CAF) scheme has attracted great interests due to its high band-width efficiency on two-way relay channels. In the CAF scheme, a relay attempts to decode a linear combination of transmitted messages from other…