Title :
A coding theorem for multiple-access decorrelating channels
Author_Institution :
Lincoln Lab., MIT, Lexington, MA, USA
Abstract :
We determine a strong coding theorem for decorrelating multiple-access channels without finite memory on past inputs and outputs but with finite memory on inputs only. We use an interleaved code argument to show the probability of error has an upper bound which decreases exponentially with the code length
Keywords :
channel coding; decorrelation; error statistics; interleaved codes; multi-access systems; multiuser channels; code length; coding theorem; error probability; finite memory; interleaved code; multiple-access decorrelating channels; Decorrelation; Delay; Fading; Interleaved codes; Laboratories; Legged locomotion; Maximum likelihood decoding; Probability density function; Stability; Upper bound;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708817
