Polynomial-time decodable codes for multiple access channels

Hideki Yagi; H. Vincent Poor

doi:10.1109/LCOMM.2010.120610.101847

Polynomial-time decodable codes for multiple access channels

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Article number	5665742
Pages (from-to)	73-75
Number of pages	3
Journal	IEEE Communications Letters
Volume	15
Issue number	1
DOIs	https://doi.org/10.1109/LCOMM.2010.120610.101847
State	Published - Jan 2011

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Keywords

Capacity-achieving code
concatenated code
error exponent
multiple access channel
polynomial-time

Access to Document

10.1109/LCOMM.2010.120610.101847

Cite this

@article{056f19cf48224700aa1dcf28817e2bac,

title = "Polynomial-time decodable codes for multiple access channels",

abstract = "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.",

keywords = "Capacity-achieving code, concatenated code, error exponent, multiple access channel, polynomial-time",

author = "Hideki Yagi and Poor, {H. Vincent}",

note = "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{\textquoteright}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: yagi@ice.uec.ac.jp). H. V. Poor is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA (e-mail: poor@princeton.edu). Digital Object Identifier 10.1109/LCOMM.2010.120610.101847",

year = "2011",

month = jan,

doi = "10.1109/LCOMM.2010.120610.101847",

language = "English (US)",

volume = "15",

pages = "73--75",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

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: yagi@ice.uec.ac.jp). H. V. Poor is with the Department of Electrical Engineering, Princeton University, Princeton, NJ 08544 USA (e-mail: poor@princeton.edu). 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 -

Polynomial-time decodable codes for multiple access channels

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this