Publication

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

Publications associées (45)

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

Iterative Coding for Network Coding

Rüdiger Urbanke, Andrea Montanari

We consider communication over a noisy network under randomized linear network coding. Possible error mechanisms include node-or link-failures, Byzantine behavior of nodes, or an overestimate of the network min-cut. Building on the work of Kotter and Kschi ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Generalized Codes on Graphs and Applications in Content Distribution

Masoud Alipour Babaei

The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...

EPFL2013

Conditions for Robustness of Polar Codes in the Presence of Channel Mismatch

Mine Alsan

A challenging problem related to the design of polar codes is "robustness against channel parameter variations'', as stated in Arıkan's original work. In this paper, we describe how the problem of robust polar code design can be viewed as a mismatch decodi ...

2013

Universal bounds on the scaling behavior of polar codes

Rüdiger Urbanke, Seyed Hamed Hassani, Ali Goli

We consider the problem of determining the tradeoff between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters as a proxy for the ...

2012

Polar Codes: Finite Length Implementation, Error Correlations and Multilevel Modulation

Shannon, in his seminal work, formalized the transmission of data over a communication channel and determined its fundamental limits. He characterized the relation between communication rate and error probability and showed that as long as the communicatio ...

2012

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

Arm velocity distribution during daily activity: objective outcome evaluation after shoulder surgery

Kamiar Aminian, Alain Farron, Cyntia Duc

This study proposed a new metric to assess the arm mobility based on the monitoring of daily activity using inertial sensors. Forty-one healthy participants and 21 patients suffering from rotator cuff tear disease were evaluated using a clinical questionna ...

2012

Polar Codes for the m-User MAC

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 Arıkan’s polarization technique applied individually to each user transforms independent uses of a m-user binary input MAC into suc ...

Institute of Electrical and Electronics Engineers2012

Analysis of the Second Moment of the LT Decoder

Mohammad Amin Shokrollahi, Ghid Maatouk

In this paper, the second moment of the ripple size during the Luby transform (LT) decoding process is analyzed. Combined with a result by Karp et al. (2004) stating that the expectation of the ripple size is of the order of k, our study gives bounds on th ...

2012

Expected loss bounds for authentication in constrained channels

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

We derive bounds on the expected loss for authenti-cation protocols in channels which are constrained due to noisyconditions and communication costs. This is motivated by anumber of authentication protocols, where at least some partof the authentication is ...

Ieee2012