Capacity and decoding rules for the Poisson arbitrarily varying channel

  • Authors:
  • S. I. Bross;S. Shamai

  • Affiliations:
  • Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel;-

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

Quantified Score

Hi-index 754.84

Visualization

Abstract

The single-user and two-user (multiple-access) Poisson arbitrarily varying channel (AVC) with input and state (peak and average power) constraints, but unlimited in bandwidth, are considered. For both cases, the deterministic and random code capacity with the average probability of error criterion is obtained. In the single-user case, A.D. Wyner's decoder (see ibid., vol.34, p.1449-61, 1988) attains the deterministic-code capacity whereas for the two-user case, a "nearest neighbor" decoder that belongs to the class of β-decoders introduced by I. Csiszar and J. Korner (see Proc. 3rd Czechoslovak-Soviet-Hungarian Seminar on Information Theory, p.25-44, 1980) is shown to attain the deterministic-code capacity region as claimed.