Publications associées à Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

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.

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

Polar Codes For Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Building on polar code constructions proposed by the authors for deterministic broadcast channels, two theorems are introduced in the present paper for noisy two-user broadcast channels. The theorems establish polar code constructions for two important ...

2013

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

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

We consider the N-user broadcast erasure channel with unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; ...

Institute of Electrical and Electronics Engineers2013

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

Irregular Product Codes

Mohammad Amin Shokrollahi, Ghid Maatouk, Seyed Omid Etesami, Masoud Alipour Babaei

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...

Ieee2012

A class of feedback-based coding algorithms for broadcast erasure channels with degraded message sets

Christina Fragouli, Shirin Saeedi Bidokhti

We consider single-hop broadcast erasure channels (BEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual queue-based algorithms in [1], which were proposed ...

2012

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Graph Chatbot

Chattez avec Graph Search

Windowed Decoding of Spatially Coupled Codes

Polar Codes For Broadcast Channels

Extended Polar Codes Perform Better in Terms of Compound Rate and Scaling Behavior

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Polarity-Balanced Codes

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

Universal bounds on the scaling behavior of polar codes

Irregular Product Codes

A class of feedback-based coding algorithms for broadcast erasure channels with degraded message sets

Polarity-Balanced Codes

Exploiting Common Randomness: a Resource for Network Secrecy

Irregular Product Codes

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

A class of feedback-based coding algorithms for broadcast erasure channels with degraded message sets

Windowed Decoding of Spatially Coupled Codes

Exploiting Common Randomness: a Resource for Network Secrecy

Polar Codes For Broadcast Channels

Universal bounds on the scaling behavior of polar codes

Extended Polar Codes Perform Better in Terms of Compound Rate and Scaling Behavior