Related papers: Block Markov Superposition Transmission of RUN Cod…
Random Linear Network Coding (RLNC) has been proved to offer an efficient communication scheme, leveraging an interesting robustness against packet losses. However, it suffers from a high computational complexity and some novel approaches,…
We present a superposition coding scheme for communication over a network, which combines partial decode and forward and noisy network coding. This hybrid scheme is termed as superposition noisy network coding. The scheme is designed and…
The design and implementation of error correcting codes has long been informed by two fundamental results: Shannon's 1948 capacity theorem, which established that long codes use noisy channels most efficiently; and Berlekamp, McEliece, and…
A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of…
This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…
This paper considers the problem of code design for a channel where communications and radar systems coexist, modeled as having both Additive White Gaussian Noise (AWGN) and Additive Radar Interference (ARI). The issue of how to adapt or…
Future beyond-5G and 6G systems demand ultra-reliable, low-latency communication with short blocklengths, motivating the development of universal decoding algorithms. Guessing decoding, which infers the noise or codeword candidate in order…
In this paper, we introduce novel coding schemes for wireless networks with random transmission delays. These coding schemes obviate the need for synchronicity, reduce the number of transmissions and achieve the optimal rate region in the…
Linear coding schemes have been the main choice of coding for the additive white Gaussian noise broadcast channel (AWGN-BC) with noiseless feedback in the literature. The achievable rate regions of these schemes go well beyond the capacity…
The capacity of the AWGN broadcast channel is achieved by superposition coding, but superposition of individual coded modulations expands the modulation alphabet and distorts its configuration. Coded modulation over a broadcast channel…
Recent advances in deep learning for wireless communications have renewed interest in channel output feedback codes. In the additive white Gaussian broadcast channel with feedback (AWGN-BC-F), feedback can expand the channel capacity region…
Random network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a non-coherent multi-shot network, where the unknown and time-variant network is used several times. In order to…
It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically…
We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the aid of relays and cooperation between destinations. The wireless nature of the medium is captured by…
In this paper, we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having {\em large dimensions}. The proposed approach involves message passing…
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed…
Designing a practical, low complexity, close to optimal, channel decoder for powerful algebraic codes with short to moderate block length is an open research problem. Recently it has been shown that a feed-forward neural network…
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…
Linear space-time block codes (STBCs) of unitary rate and full diversity, systematically constructed over arbitrary constellations for any number of transmit antennas are introduced. The codes are obtained by generalizing the existing ABBA…
In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code…