Publications associées à Code de répétition

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Rüdiger Urbanke, Shrinivas Kudekar

We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a priori threshold of the u ...

Institute of Electrical and Electronics Engineers2013

Approximate Decoding Approaches for Network Coded Correlated Data

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

This paper considers a framework where data from correlated sources are transmitted with help of network coding in ad-hoc network topologies. The correlated data are encoded independently at sensors and network coding is employed in the intermediate nodes ...

Institute of Electrical and Electronics Engineers2013

Windowed Decoding of Spatially Coupled Codes

Rüdiger Urbanke

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as fo ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Exploiting Common Randomness: a Resource for Network Secrecy

Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Ieee2013

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

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Mohammad Amin Shokrollahi, Yuval Cassuto

Probabilistic construction of codes on two-dimensional arrays is proposed and analyzed. Instead of a pure combinatorial erasure model used in traditional array codes, we propose a mixed combinatorial-probabilistic model of limiting the number of column fai ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

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.

Code de répétition

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Approximate Decoding Approaches for Network Coded Correlated Data

Windowed Decoding of Spatially Coupled Codes

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Generalized Codes on Graphs and Applications in Content Distribution

Spatially coupled ensembles universally achieve capacity under belief propagation

Universal bounds on the scaling behavior of polar codes

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Graph Chatbot

Chattez avec Graph Search

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Generalized Codes on Graphs and Applications in Content Distribution

Windowed Decoding of Spatially Coupled Codes

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Exploiting Common Randomness: a Resource for Network Secrecy

Universal bounds on the scaling behavior of polar codes

Approximate Decoding Approaches for Network Coded Correlated Data

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Spatially coupled ensembles universally achieve capacity under belief propagation

Exploiting Common Randomness: a Resource for Network Secrecy