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

Limits on Support Recovery with Probabilistic Models: An Information-Theoretic Framework

The support recovery problem consists of deter- mining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as group testing, compressive sensing, and subset selection in ...

2015

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Jonathan Mark Scarlett

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

Secure Network Coding With Erasures and Feedback

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

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this pa ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel

Jonathan Mark Scarlett, Albert Guillén i Fàbregas

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's comb ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Asynchronous Decoding of LDPC Codes over BEC

Amin Karbasi, Amir Hesam Salavati, Saeid Haghighatshoar

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

2015

Second-order asymptotics for the Gaussian MAC with degraded message sets

Jonathan Mark Scarlett

This paper studies the second-order asymptotics of the Gaussian multiple-access channel with degraded message sets. For a fixed average error probability epsilon is an element of (0, 1) and an arbitrary point on the boundary of the capacity region, we char ...

Institute of Electrical and Electronics Engineers2015

Refresh-Free Dynamic Standard-Cell Based Memories: Application to a QC-LDPC Decoder

Andreas Peter Burg, Pascal Andreas Meinerzhagen, Georgios Karakonstantis, Andrea Bonetti

The area and power consumption of low-density parity check (LDPC) decoders are typically dominated by embedded memories. To alleviate such high memory costs, this paper exploits the fact that all internal memories of a LDPC decoder are frequently updated w ...

2015

Polar Codes for Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m-independent messages to one codeword while satisfying broadcast constrai ...

Institute of Electrical and Electronics Engineers2015

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

Limits on Support Recovery with Probabilistic Models: An Information-Theoretic Framework

Low Complexity Scheduling and Coding for Wireless Networks

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Secure Network Coding With Erasures and Feedback

Re-proving Channel Polarization Theorems

Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel

Asynchronous Decoding of LDPC Codes over BEC

Second-order asymptotics for the Gaussian MAC with degraded message sets

Refresh-Free Dynamic Standard-Cell Based Memories: Application to a QC-LDPC Decoder

Polar Codes for Broadcast Channels

Graph Chatbot

Chattez avec Graph Search

Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel

Second-order asymptotics for the Gaussian MAC with degraded message sets

Refresh-Free Dynamic Standard-Cell Based Memories: Application to a QC-LDPC Decoder

Polar Codes for Broadcast Channels

Low Complexity Scheduling and Coding for Wireless Networks

Asynchronous Decoding of LDPC Codes over BEC

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Secure Network Coding With Erasures and Feedback

Re-proving Channel Polarization Theorems

Limits on Support Recovery with Probabilistic Models: An Information-Theoretic Framework