DocumentCode
639861
Title
The mismatched multiple-access channel: General alphabets
Author
Scarlett, Jonathan ; Martinez, A. ; Fabregas, Albert Guillen i
fYear
2013
fDate
7-12 July 2013
Firstpage
86
Lastpage
90
Abstract
This paper considers channel coding for the memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. Non-asymptotic bounds on the error probability are given, and a cost-constrained random-coding ensemble is used to obtain an achievable error exponent. The achievable rate region recovered by the error exponent coincides with that of Lapidoth in the discrete memoryless case, and remains valid for more general alphabets.
Keywords
channel coding; decoding; error statistics; memoryless systems; multi-access systems; random codes; Lapidoth; achievable error exponent; achievable rate region; channel coding; cost-constrained random-coding ensemble; discrete memoryless case; error probability; memoryless multiple-access channel; mismatched multiple-access channel; nonasymptotic bounds; suboptimal decoding rule; Cost function; Decoding; Error probability; Joints; Measurement; Minimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620193
Filename
6620193
Link To Document