DocumentCode :
2420720
Title :
An explicit construction of concatenated codes for multiple access channels
Author :
Yagi, Hideki ; Poor, H. Vincent
Author_Institution :
Center for Frontier Sci. & Eng., Univ. of Electro-Commun., Chofu, Japan
fYear :
2010
fDate :
Sept. 29 2010-Oct. 1 2010
Firstpage :
466
Lastpage :
473
Abstract :
Recently, a construction of polynomial-time decodable codes for discrete memoryless multiple access channels (MACs) has been proposed based on multi-level concatenated coding. This paper provides several refinements to concatenated codes for MACs. First, an explicit construction of inner codes is devised based on an ensemble of affine codes so that no search for good inner codes that achieve the capacity region is needed. Then a new decoding algorithm is proposed in which the inner decoding and the outer decoding alternate to improve a lower bound on the error exponent. It is shown that the proposed codes still arbitrarily approach every interior point of the capacity region for a given MAC with polynomial-time decoding complexity.
Keywords :
channel capacity; concatenated codes; multi-access systems; telecommunication channels; affine codes; capacity region; discrete memoryless multiple access channels; multi-level concatenated coding; polynomial-time decodable codes; Bismuth; Complexity theory; Concatenated codes; Encoding; Maximum likelihood decoding; Probability distribution;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on
Conference_Location :
Allerton, IL
Print_ISBN :
978-1-4244-8215-3
Type :
conf
DOI :
10.1109/ALLERTON.2010.5706943
Filename :
5706943
Link To Document :
بازگشت