TY - JOUR
T1 - Error exponents for the two-user Poisson multiple-access channel
AU - Bross, Shraga I.
AU - Burnashev, Marat V.
AU - Shamai, Shlomo
PY - 2000
Y1 - 2000
N2 - The error exponent of the two-user Poisson multiple-access channel under peak and average power constraints, but unlimited in bandwidth, is considered. First, a random coding lower bound on the error exponent is obtained, and an extension of Wyner's single-user codes [1] is shown to be exponentially optimum for this case as well. Second, the sphere packing bounding technique suggested in [2] is generalized to the case at hand and an upper bound on the error exponent, which coincides with the lower bound, is derived.
AB - The error exponent of the two-user Poisson multiple-access channel under peak and average power constraints, but unlimited in bandwidth, is considered. First, a random coding lower bound on the error exponent is obtained, and an extension of Wyner's single-user codes [1] is shown to be exponentially optimum for this case as well. Second, the sphere packing bounding technique suggested in [2] is generalized to the case at hand and an upper bound on the error exponent, which coincides with the lower bound, is derived.
UR - http://www.scopus.com/inward/record.url?scp=0034449779&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0035396898
SN - 2157-8095
SP - 38
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
ER -