Publication

Re-proving Channel Polarization Theorems

Publications associées (303)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The case for structured random codes in network capacity theorems

Michael Christoph Gastpar

Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding arguments, such as ran ...

2008

Geometry-based distributed coding of multi-view omnidirectional images

Pascal Frossard, Ivana Tosic

This paper presents a distributed and occlusion-robust coding scheme for multi-view omnidirectional images, which relies on the geometry of the 3D scene. The Wyner-Ziv coder uses a multi-view correlation model that relates 3D features in different images u ...

2008

Asymmetric multi-level diversity coding

Suhas Diggavi

Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , k, where k is the number of encoders to which they have access. In this paper ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2008

On the Performance of Random Linear Network Coding in Relay Networks

Ramin Khalili

We compare the reliability performance gain of Random Linear Network Coding (RLNC) with Automatic Repeat Request (ARQ) for a wireless relay network taking into account overhead and complexity of feedback mechanism as well as overhead due to encoding vector ...

2008

Variability-Aware Design of Multilevel Logic Decoders for Nanoscale Crossbar Memories

Giovanni De Micheli, Mihai Adrian Ionescu, David Atienza Alonso, Didier Bouvet, Kirsten Emilie Moselund, Yusuf Leblebici, Mohamed Haykel Ben Jamaa

The fabrication of crossbar memories with sublithographic features is expected to be feasible within several emerging technologies; in all of them, the nanowire (NW) decoder is a critical part since it bridges the sublithographic wires to the outer circuit ...

2008

Tight bounds on the AUH codes

Ali Kakhbod

In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper hounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. Also an upper bound on the entropy of AUH co ...

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

A family of non-binary TLDPC codes: density evolution, convergence and thresholds

We generalize the results about how to compute iterative decoding thresholds over the binary erasure channel of non-binary LDPC code ensembles of [16] to non-binary TLDPC codes [2], [3]. We show in this case how density evolution can be performed in order ...

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

Distributed coding of multiresolution omnidirectional images

Pascal Frossard, Ivana Tosic, Vijayaraghavan Thirumalai

This paper addresses the problem of compact representation of a 3D scene, captured by distributed omnidirectional cameras. As the images from the sensors are likely to be correlated in most practical scenarios, we build a distributed algorithm based on cod ...

2007

Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel

Nicolas Macris, Satish Babu Korada, Shrinivas Kudekar

We consider communication over a binary erasure channel with low density parity check codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code ensembles, in the asymptotic li ...

2007

Cryptography based on error correcting codes

Lorenz Minder

The idea to use error-correcting codes in order to construct public key cryptosystems was published in 1978 by McEliece [ME1978]. In his original construction, McEliece used Goppa codes, but various later publications suggested the use of different familie ...

EPFL2007