Scarlett, J and Martinez, A and Guillen I Fabregas, A (2013) The mismatched multiple-access channel: General alphabets. In: UNSPECIFIED pp. 86-90..Full text not available from this repository.
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. © 2013 IEEE.
|Item Type:||Conference or Workshop Item (UNSPECIFIED)|
|Divisions:||Div F > Signal Processing and Communications|
|Depositing User:||Cron Job|
|Date Deposited:||07 Mar 2014 12:01|
|Last Modified:||08 Dec 2014 02:16|