Lattice codes are known to achieve capacity in the Gaussian point-to-point channel,
achieving the same rates as iid random Gaussian codebooks. Lattice codes are also known …

It has been conjectured that lattice codes are good for (almost) everything. As an additional
bit of evidence for this claim, we offer a few results showing the utility of lattice codes for the …

We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of
a particular size which contains the transmitted codeword with high probability. This list …

We provide achievable rate regions for two-way relay channels (TRC). At first, for a binary
TRC, we show that the subspace-sharing of linear codes can achieve the capacity region …

Abstract In [1], a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been
demonstrated to approximately achieve (within an additive constant number of bits) the …

Recently, it has been shown that a quantize-map-and-forward scheme approximately
achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary …

Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been
demonstrated to approximately achieve (within an additive constant number of bits) the …

In this paper, we consider a class of single-source multicast relay networks. We assume that
all outgoing channels of a node in the network to its neighbors are orthogonal while the …

This paper studies a Gaussian two-way relay channel where two communication nodes
exchange messages with each other via a relay. It is assumed that all nodes operate in half …

In this paper, a Gaussian two-way relay channel, where two source nodes exchange
messages with each other through a relay, is considered. We assume that all nodes operate …