Concept

Concatenated error correction code

Publications associées (255)

Feedback-based coding algorithms for broadcast erasure channels with degraded message sets

Christina Fragouli, Shirin Saeedi Bidokhti

We consider single-hop broadcast packet erasure channels (BPEC) 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 ...

2012

Correlation-Aware Reconstruction of Network Coded Sources

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we consider the problem of decoding network coded correlated data when the decoder does not receive sufficient information for exact decoding. We propose an iterative decoding algorithm based on belief propagation that efficiently exploits t ...

2012

Feedback-based Coding Algorithms for Braodcast Erasure Channels with Degraded Message Sets

Christina Fragouli

2012

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

Layered Detection and Decoding in MIMO Wireless Systems

Andreas Peter Burg, Nicholas Alexander Preyss, Christoph Studer

Iterative detection and decoding (IDD) in multiple-input multiple-output (MIMO) wireless systems is known to achieve near channel capacity. The high computational complexity of IDD, however, poses signiﬁcant challenges for practical implementations (in ter ...

2012

Beyond the Bethe Free Energy of LDPC Codes via Polymer Expansions

Nicolas Macris, Marc Vuffray

The loop series provides a formal way to write down corrections to the Bethe entropy (and/or free energy) of graphical models. We provide methods to rigorously control such expansions for low-density parity-check codes used over a highly noisy binary symme ...

Ieee2012

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

Channel Coding Optimization Based on Slice Visibility for Transmission of Compressed Video over OFDM Channels

Laura Toni

Optimization of multimedia transmissions over wireless channels should be aimed at maximizing the video quality perceived by the final user. For transmission of video sequences over an orthogonal frequency division multiplexing (OFDM) system in a slowly va ...

2012

Encoding and decoding of generalized Reed-Solomon codes using parallel processing techniques

Mohammad Amin Shokrollahi

A system, computer program, and/or method for encoding data that can correct r/2 errors. The original symbols are transformed using a Fourier transform of length p. Generator polynomials are used to encode the p blocks separately, and an inverse Fourier tr ...

2012

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