By Topic

Capacity and decoding rules for the Poisson arbitrarily varying channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. I. Bross ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; S. Shamai

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.

Published in:

IEEE Transactions on Information Theory  (Volume:49 ,  Issue: 11 )