Publications related to Error exponent

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless channels for ordinary and list-decoding schemes, in particular Berlekamp and Blinovsky's zero-rate bound, as well as Blahut's bound for low rates. The available ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Optimal Combination Policies For Adaptive Social Learning

Ping Hu, Stefan Vlaski, Virginia Bordignon

This paper investigates the effect of combination policies on the performance of adaptive social learning in non-stationary environments. By analyzing the relation between the error probability and the underlying graph topology, we prove that in the slow a ...

IEEE2022

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Emmanuel Abbé, Min Ye

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Strengthened Information-theoretic Bounds on the Generalization Error

Michael Christoph Gastpar, Amedeo Roberto Esposito, Ibrahim Issa

The following problem is considered: given a joint distribution P XY and an event E, bound P XY (E) in terms of P X P Y (E) (where P X P Y is the product of the marginals of P XY ) and a measure of dependence of X and Y. Such bounds have direct application ...

IEEE2019

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Rüdiger Urbanke, Seyed Hamed Hassani, Shrinivas Kudekar, Yury Polyanskiy

Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillic ...

IEEE2018

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Emre Telatar, Rajai Nasser

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasi-group structure on the input alphabet. Just as with usual polar codes, the block error probability under successive cancellation decoding is O(2^(-N^(1/2-epsilon))), where N ...

Institute of Electrical and Electronics Engineers2016

Multiuser Random Coding Techniques for Mismatched Decoding

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

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensem ...

Institute of Electrical and Electronics Engineers2016

A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels

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

This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the Csiszar-Korner-Hui rate, thus providing a counter-example to a p ...

Institute of Electrical and Electronics Engineers2015

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Error exponent

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

Optimal Combination Policies For Adaptive Social Learning

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Strengthened Information-theoretic Bounds on the Generalization Error

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Coding for Communications and Secrecy

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Multiuser Random Coding Techniques for Mismatched Decoding

A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels

Graph Chatbot

Chat with Graph Search

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Optimal Combination Policies For Adaptive Social Learning

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Coding for Communications and Secrecy

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Multiuser Random Coding Techniques for Mismatched Decoding

Strengthened Information-theoretic Bounds on the Generalization Error

A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels