Publication

Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes

Related publications (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Polar Codes for the m-User Multiple Access Channel

Emre Telatar, Emmanuel Abbé

In this paper, polar codes for the m-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Arikan's polarization technique applied individually to each user transforms independent uses of an m-user binary input MAC into su ...

Institute of Electrical and Electronics Engineers2012

The quantum mechanics of perfect fluids

Riccardo Rattazzi, Solomon G Shamsuddin Osman Endlich

We consider the canonical quantization of an ordinary fluid. The resulting long-distance effective field theory is derivatively coupled, and therefore strongly coupled in the UV. The system however exhibits a number of peculiarities, associated with the vo ...

2011

Polar codes for the m-user multiple access channels

Rajai Nasser

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding decays exponentially with the square root of the block length. Although the ...

2011

Polar codes for channel and source coding

Satish Babu Korada

The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...

EPFL2009

Linear Universal Decoder for Compound Discrete Memoryless Channels

Rethnakaran Pulikkoonattu

Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...

2009

Performance of Sigma-Delta Quantizations in Finite Frames

In this paper, we consider sigma-delta (SD) quantization of geometrically uniform (GU) finite frames. In the first part, we prove that under some conditions, the variant I and II permutation modulation (PM) codes, first introduced by Slepian (1968, 1965), ...

2008

Multiple description image coding with redundant expansions and optimal quantization

Pascal Frossard, Ivana Radulovic

This paper addresses the problem of optimal rate allocation for multiple description coding with redundant signal expansions. In case of redundant descriptions, the quantization of the transform coefficients has clearly to be adapted to the importance of t ...

2007

Multiple description image coding with redundant expansions and optimal quantization

Pascal Frossard, Ivana Radulovic

2007

Multiple description image coding with redundant expansions and optimal quantization

Pascal Frossard, Ivana Radulovic

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Channel coding and modulation based on chaotic systems

Slobodan Kozic

In this thesis, a new class of codes on graphs based on chaotic dynamical systems are proposed. In particular, trellis coded modulation and iteratively decodable codes on graphs are studied. The codes are designed by controlling symbolic dynamics of chaoti ...

EPFL2006