Publications associées à Théorème du codage de canal

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successiv ...

Ieee2014

Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations

Mine Alsan

We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager's reliability function E-0 of binary input discrete memoryless channels evaluated under the uniform input distribution from the aspect of channel polarizat ...

Institute of Electrical and Electronics Engineers2014

Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently ...

Institute of Electrical and Electronics Engineers2014

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Universal Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani

Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless outputsymmetric channel. Further, both the encoding and the decoding can be accomplished in O(N log(N)) real operations, where N is the blocklength. O ...

Ieee2014

Integer-forcing Linear Receivers

Michael Christoph Gastpar

Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be ...

Institute of Electrical and Electronics Engineers2014

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smalle ...

Ieee2014

From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Ieee-Inst Electrical Electronics Engineers Inc2014

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

Michael Christoph Gastpar, Amos Lapidoth

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sumrate that the scheme achieves and the full-cooperation bound vanishes as the sig ...

Institute of Electrical and Electronics Engineers2014

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.

Théorème du codage de canal

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations

Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage

Error-correcting multi-stage code generator and decoder for communication systems having single transmitters or multiple transmitters

LDPC Codes for 2D Arrays

Universal Polar Codes

Integer-forcing Linear Receivers

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

Graph Chatbot

Chattez avec Graph Search

Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

LDPC Codes for 2D Arrays

Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

Error-correcting multi-stage code generator and decoder for communication systems having single transmitters or multiple transmitters

Universal Polar Codes

From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Integer-forcing Linear Receivers