In the setting of a Gaussian channel without power constraints, proposed by Poltyrev in
1994, the codewords are points in an n-dimensional Euclidean space (an infinite …

Quantize-map-and-forward (QMF) is a relaying scheme that has been shown to achieve the
capacity of Gaussian relay networks to within a constant gap. Under QMF the compression …

In this paper we develop a low-complexity coding scheme and system design framework for
the half duplex relay channel based on the Quantize-Map-and-Forward (QMF) relaying …

In cognitive radio (CR) wireless mesh networks (WMNs), wireless mesh routers work as
secondary users (SUs) that can opportunistically and intelligently access the idle licensed …

The communication model of a memoryless channel that depends on a random state that is
known at the receiver only is studied. The channel can be thought of as a set of underlying …

Finding the minimum distance of low-density-parity-check (LDPC) codes is an NP-hard
problem. Different from all existing works that focus on binary LDPC codes, we in this paper …

Wireless networks are experiencing an explosive growth in the number of users and the
demand for data capacity. One of the methods to improve capacity is to use tighter …

In this paper, we design and analyze an improved bit-interleaved coded modulation (CM)
scheme with a pseudorandom sequence (BICM-P). For the proposed scheme, the …

The theory of finite blocklength coding provides powerful tools to approximate the maximum
achievable rate for short blocklength coding. In this work, the normal approximation is …

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the
codewords are points in an n-dimensional Euclidean space (an infinite constellation) and …