Polynomial-time decodable codes for multiple access channels

Hideki Yagi, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Article number5665742
Pages (from-to)73-75
Number of pages3
JournalIEEE Communications Letters
Issue number1
StatePublished - Jan 2011
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


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


Dive into the research topics of 'Polynomial-time decodable codes for multiple access channels'. Together they form a unique fingerprint.

Cite this