We prove that the ensemble of the nested coset codes built on finite fields achieves the
capacity of arbitrary discrete memoryless point-to-point channels. Exploiting its algebraic …

We consider the problem of developing coding techniques and deriving achievable rate
regions for discrete memoryless broadcast channels with three receivers (3-DBC). We begin …

In this paper, we study the asymptotic performance of Abelian group codes for the channel
coding problem for arbitrary discrete (finite alphabet) memoryless channels as well as the …

This work considers an information-theoretic characterization of the set of achievable rates,
costs, and distortions in a broad class of distributed communication and function …

We present an achievable rate region for the general three user discrete broadcast channel
(DBC), based on coset codes. We identify an example of a three user DBC for which the …

Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore,
Nazer, and Gastpar, this paper studies the potential of structured coset coding as a complete …

We consider the problem of multiple descriptions (MDs) source coding and propose new
coding strategies involving both unstructured and structured coding layers. Previously, the …

The problem of computing a linear combination of sources over a multiple access channel is
studied. Inner and outer bounds on the optimal tradeoff between the communication rates …

Recent studies by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar
built the framework of nested coset codes for the computation problem, namely, computing a …

A new coding scheme for the L-descriptions problem is proposed. In particular we consider
continuous sources and lattice quantizers. New covering and packing bounds for using …