Related papers: Polar Lattices for Lossy Compression
In this paper, we consider the Ice-Wine problem: Two transmitters send their messages over the Gaussian Multiple-Access Channel (MAC) and a receiver aims to recover a linear combination of codewords. The best known achievable rate-region…
Constrained lossy source coding and channel coding with side information problems which extend the classic Wyner-Ziv and Gel'fand-Pinsker problems are considered. Inspired by applications in sensor networking and control, we first consider…
It is known that polar codes can be efficiently constructed for binary-input channels. At the same time, existing algorithms for general input alphabets are less practical because of high complexity. We address the construction problem for…
The non-ergodic fading channel is a useful model for various wireless communication channels in both indoor and outdoor environments. Building on Poltyrev's work on infinite lattice constellations for the Gaussian channel, we derive a…
We consider the problem of using polar codes over slow fading wireless channels. For design, we focus on a parallel slow fading channel with 2 blocks, and polar codes with rate <= 1/2. Motivated by Arikan's systematic polar code…
In this work, we address the low-complexity construction of shortened and punctured polar codes from a unified view. While several independent puncturing and shortening designs were attempted in the literature, our goal is a unique,…
In this paper, we address the design of high spectral-efficiency Barnes-Wall (BW) lattice codes which are amenable to low-complexity decoding in additive white Gaussian noise (AWGN) channels. We propose a new method of constructing complex…
Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…
Interacting bosonic particles in artificial lattices have proven to be a powerful tool for the investigation of exotic phases of matter as well as phenomena resulting from non-trivial topology. Exciton-polaritons, bosonic quasi-particles of…
Interacting Bosons, loaded in artificial lattices, have emerged as a modern platform to explore collective manybody phenomena, quantum phase transitions and exotic phases of matter as well as to enable advanced on chip simulators. Such…
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described…
We describe a novel approach to interpret a polar code as a low-density parity-check (LDPC)-like code with an underlying sparse decoding graph. This sparse graph is based on the encoding factor graph of polar codes and is suitable for…
A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding…
Artificial one- and two-dimensional lattices have emerged as a powerful platform for the emulation of lattice Hamiltonians, the fundamental study of collective many-body effects, and phenomena arising from non-trivial topology.…
We consider the lossy quantum source coding problem where the task is to compress a given quantum source below its von Neumann entropy. Inspired by the duality connections between the rate-distortion and channel coding problems in the…
A modification to 5G New Radio (NR) polar code is proposed, which improves the error correction performance with higher order modulation through probabilistic shaping. The presented scheme mainly re-uses existing hardware at the…
This paper considers lossy source coding of $n$-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion $d$ no greater than $\epsilon$,…
An implementation-efficient finite alphabet decoder for polar codes relying on coarsely quantized messages and low-complexity operations is proposed. Typically, finite alphabet decoding performs concatenated compression operations on the…
Channel polarization is a phenomenon in which a particular recursive encoding induces a set of synthesized channels from many instances of a memoryless channel, such that a fraction of the synthesized channels becomes near perfect for data…
A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation (PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded modulation…