TY - JOUR
T1 - Capacity and Decoding Rules for the Poisson Arbitrarily Varying Channel
AU - Bross, Shraga I.
AU - Shamai, Shlomo
PY - 2003/11
Y1 - 2003/11
N2 - 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, Wyner's decoder attains the deterministic-code capacity whereas for the two-user case, a "nearest neighbor" decoder that belongs to the class of β-decoders introduced in [8] is shown to attain the deterministic-code capacity region as claimed.
AB - 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, Wyner's decoder attains the deterministic-code capacity whereas for the two-user case, a "nearest neighbor" decoder that belongs to the class of β-decoders introduced in [8] is shown to attain the deterministic-code capacity region as claimed.
KW - Arbitrarily varying channel (AVC)
KW - Deterministic-code capacity
KW - Poisson channels
UR - http://www.scopus.com/inward/record.url?scp=0344012601&partnerID=8YFLogxK
U2 - 10.1109/tit.2003.818385
DO - 10.1109/tit.2003.818385
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0344012601
SN - 0018-9448
VL - 49
SP - 3076
EP - 3093
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 11
ER -