Publication

Polar codes for the m-user multiple access channels

Related publications (43)

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.

Concentration of Magnetization for Linear Block Codes

Nicolas Macris, Satish Babu Korada, Shrinivas Kudekar

We consider communication over the binary erasure and the binary additive white gaussian noise channels using fixed linear block codes and also appropriate ensembles of such codes. We show concentration of the magnetization over the channel realizations an ...

2008

Rateless coding with partial CSI at the decoder

Michael Christoph Gastpar

A channel model for channels with unknown state and partial state information available causally at the decoder is proposed. The model is based on arbitrarily varying channels (AVCs), and the partial state information is characterized by allowing the decod ...

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

Primality Testing

Kamal Tahiri Jouti

Since the discovery of the utility of the numbers, the human being tried to differentiate them. We decide between them according to whether they are even or odd. Or, according to the fact that they are prime or composite. A natural number n >1 is called a ...

2006

Efficient error correction solutions for OFDM based digital video

Mauro Lattuada

The robustness of the delivery of digital compressed video streams has always been one of the main topic of the standardization bodies to assure the Quality of the Service (QoS). The MPEG standard which is nowadays the reference for digital television defi ...

EPFL2005

Concatenated codes for block-fading channels

Albert Guillén i Fàbregas

In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in prac ...

EPFL2004

Optimal feedback schemes over unknown channels

Emre Telatar

Communication over unknown discrete memoryless channels with instantaneous and perfect feedback is considered. For a given set of channels we define a notion of optimal coding schemes in terms of achievable rate and error exponent, and prove the existence ...

2004

Optimal feedback schemes over unknown channels

Emre Telatar, Aslan Tchamkerten

2004

Temperature dependence of the photoluminescence lifetime in disordered quantum wires

Benoît Marie Joseph Deveaud, Vincenzo Savona, Andrea Feltrin

We present a theoretical model of the time-resolved excitonic photoluminescence in quantum wires. We study the role of disorder on the temperature dependence of the photoluminescence lifetime. We find that at low temperature the exciton population is not t ...

V C H PUBLISHERS, SUITE 909, 220 E 23RD ST, NEW YORK, NY 10010 USA2004

Undetection error probability of linear and alternating-phase codes over the timing error channel

Paolo Ienne, Patrick Thiran, Frédéric Worm

We develop a channel model for errors originated from over-aggressive operation of a communication link. Such a situation arises in the context of on-chip self-calibrating communication, where a link controller has to determine adaptively the operating vol ...

2004