TY - JOUR
T1 - Polynomial-time decodable codes for multiple access channels
AU - Yagi, Hideki
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received September 30, 2010. The associate editor coordinating the review of this letter and approving it for publication was V. Stankovic. This research was supported in part by MEXT under Grant-in-Aid for Young Scientists (B) No. 22760270, JST’s Special Coordination Funds for Promoting Science and Technology, and the U.S. National Science Foundation under Grant CNS-09-05398. H. Yagi is with the Center for Frontier Science and Engineering, The University of Electro-Communications, Chofu-shi, Tokyo 182-8585, Japan (e-mail: [email protected]). H. V. Poor is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA (e-mail: [email protected]). Digital Object Identifier 10.1109/LCOMM.2010.120610.101847
PY - 2011/1
Y1 - 2011/1
N2 - A construction of polynomial-time decodable codes for discrete memoryless multiple access channels (MACs) is proposed based on concatenated codes. Concatenated codes, originally developed by Forney, can achieve any rate below capacity for the single-user discrete memoryless channel while requiring only polynomial-time decoding complexity in the code length. In this letter, Forney's construction together with multi-level concatenation is generalized to MACs. An error exponent for the constructed code is derived, and it is shown that the constructed code can achieve any rate in the capacity region.
AB - A construction of polynomial-time decodable codes for discrete memoryless multiple access channels (MACs) is proposed based on concatenated codes. Concatenated codes, originally developed by Forney, can achieve any rate below capacity for the single-user discrete memoryless channel while requiring only polynomial-time decoding complexity in the code length. In this letter, Forney's construction together with multi-level concatenation is generalized to MACs. An error exponent for the constructed code is derived, and it is shown that the constructed code can achieve any rate in the capacity region.
KW - Capacity-achieving code
KW - concatenated code
KW - error exponent
KW - multiple access channel
KW - polynomial-time
UR - http://www.scopus.com/inward/record.url?scp=79551685745&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79551685745&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2010.120610.101847
DO - 10.1109/LCOMM.2010.120610.101847
M3 - Article
AN - SCOPUS:79551685745
SN - 1089-7798
VL - 15
SP - 73
EP - 75
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 1
M1 - 5665742
ER -