Two proofs of Pinsker's conjecture concerning arbitrarily varying channels

  • Authors:

  • R. Ahlswede;N. Cai

  • Affiliations:

  • Fakultat fuer Math., Bielefeld Univ.;-

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

Quantified Score

Hi-index 754.84

Visualization

Abstract

M.S. Pinsker (1990) conjectured the following theorem: for an arbitrary varying channel (AVC), every rate below the random code capacity is achievable with deterministic list codes of constant list size, if the average error criterion is used. Two proofs of this theorem are given