An explicit construction of concatenated codes for multiple access channels

Hideki Yagi; H. Vincent Poor

doi:10.1109/ALLERTON.2010.5706943

An explicit construction of concatenated codes for multiple access channels

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Pages	466-473
Number of pages	8
DOIs	https://doi.org/10.1109/ALLERTON.2010.5706943
State	Published - 2010
Event	48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 - Monticello, IL, United States Duration: Sep 29 2010 → Oct 1 2010

Publication series

Name	2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Other

Other	48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Country/Territory	United States
City	Monticello, IL
Period	9/29/10 → 10/1/10

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Control and Systems Engineering

Access to Document

10.1109/ALLERTON.2010.5706943

Cite this

Yagi, H., & Poor, H. V. (2010). An explicit construction of concatenated codes for multiple access channels. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 (pp. 466-473). Article 5706943 (2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010). https://doi.org/10.1109/ALLERTON.2010.5706943

@inproceedings{6afbf8c83f104eafab3ed4ad9529fbfb,

title = "An explicit construction of concatenated codes for multiple access channels",

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

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

year = "2010",

doi = "10.1109/ALLERTON.2010.5706943",

language = "English (US)",

isbn = "9781424482146",

series = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",

pages = "466--473",

booktitle = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",

note = "48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 ; Conference date: 29-09-2010 Through 01-10-2010",

}

Yagi, H & Poor, HV 2010, An explicit construction of concatenated codes for multiple access channels. in 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010., 5706943, 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, pp. 466-473, 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, Monticello, IL, United States, 9/29/10. https://doi.org/10.1109/ALLERTON.2010.5706943

An explicit construction of concatenated codes for multiple access channels. / Yagi, Hideki; Poor, H. Vincent.
2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 466-473 5706943 (2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An explicit construction of concatenated codes for multiple access channels

AU - Yagi, Hideki

AU - Poor, H. Vincent

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79952430916&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952430916&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2010.5706943

DO - 10.1109/ALLERTON.2010.5706943

M3 - Conference contribution

AN - SCOPUS:79952430916

SN - 9781424482146

T3 - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

SP - 466

EP - 473

BT - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

T2 - 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Y2 - 29 September 2010 through 1 October 2010

ER -

An explicit construction of concatenated codes for multiple access channels

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this