# Error exponent

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- IEEE Information Theory Workshop (ITW)
- 2017

In this work, we derive the random coding error exponent for the uplink phase of a two-way relay system where physical layer… (More)

Is this relevant?

2015

2015

- IEEE International Symposium on Information…
- 2015

Improved exponential error bounds are derived for frame-asynchronous discrete memoryless multiple access channels with two… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- IEEE Transactions on Information Theory
- 2009

Polar codes were recently introduced by Arikan. They achieve the symmetric capacity of arbitrary binary-input discrete memoryless… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE Transactions on Information Theory
- 2008

An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper… (More)

Is this relevant?

2008

2008

- IEEE Transactions on Information Theory
- 2008

In modern communication systems, different users have different requirements for quality of service (QoS). In this work, QoS… (More)

Is this relevant?

2007

2007

- IEEE International Symposium on Information…
- 2007

Multihop channels are believed to provide benefits in performance because the reduction in transmission distance per hop directly… (More)

Is this relevant?

2006

2006

- IEEE International Symposium on Information…
- 2006

The Shannon rate-distortion function for arbitrary varying source (AVS) coding subject to error exponent or reliability criterion… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- IEEE Trans. Information Theory
- 2002

—Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes… (More)

Is this relevant?

1996

1996

- IEEE Trans. Information Theory
- 1996

AbstructWe consider the problem of estimating the order of a stationary ergodic Markov chain. Our focus is on estimators which… (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- IEEE Trans. Information Theory
- 1982

A/~~stract-For Slepian-Wolf source networks, the error exponents obtained by Kiirner, Marton, and the author are shown to be… (More)

Is this relevant?