A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels

  • Authors:

  • V. B. Balakirsky

  • Affiliations:

  • Dept. of Inf. Theory, Lund Univ.

  • Venue:
  • IEEE Transactions on Information Theory - Part 2
  • Year:
  • 1995

Quantified Score

Hi-index 0.12

Visualization

Abstract

An upper bound on the maximal transmission rate over binary-input memoryless channels, provided that the decoding decision rule is given, is derived. If the decision rule is equivalent to the maximum-likelihood decoding (matched decoding), then the bound coincides with the channel capacity. Otherwise (mismatched decoding), it coincides with a known lower bound