By Topic

Mismatched decoding and the multiple-access 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
$31 $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

1 Author(s)
Lapidoth, A. ; Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA

An achievable region is derived for the multiple-access channel under decoding mismatch conditions. It is shown that achievable rates higher than the random coding capacity of the single-user mismatched channel can sometimes be demonstrated by treating the single-user channel as a multiple-access channel. Refining these ideas we derive a lower bound on the capacity of the mismatched single-user channel, which is tighter than previously published bounds. Using this bound, we are able to answer in the negative the question raised by Csiszar and Narayan (see ibid., vol.41, no.1, p.35, 1995) as to whether equality between the mismatch capacity and the matched capacity implies that the random coding lower bound to the mismatch capacity is tight

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 5 )