Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)

Authors:
G. Dueck;J. Korner
Affiliations:
-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 1

The asymptotic equipartition property in reinforcement learning and its relation to return maximization

Neural Networks

Quantified Score

Hi-index	754.84

Visualization

Abstract

Asymptotically coincident upper and lower bounds on the exponent of the largest possible probability of the correct decoding of block codes are given for all rates above capacity. The lower bound sharpens Omura's bound. The upper bound is proved by a new and simple combinatorial argument.