An upper bound on the cutoff rate of sequential decoding

  • Authors:

  • E. Arikan

  • Affiliations:

  • -

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 1988

Quantified Score

Hi-index 754.84

Visualization

Abstract

An upper bound is given on the cutoff rate of discrete memoryless channels. This upper bound, which coincides with a known lower bound, determines the cutoff rate, and settles a long-standing open problem