Constructing polar codes for non-binary alphabets and MACs

Ido Tal; Artyom Sharov; Alexander Vardy

doi:10.1109/ISIT.2012.6283739

Constructing polar codes for non-binary alphabets and MACs

Ido Tal, Artyom Sharov, Alexander Vardy

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

Abstract

Consider a channel with an input alphabet that is finite but not necessarily binary. A method for approximating such a channel having a large output alphabet size by a degraded version of it having a smaller output alphabet size is presented and analyzed. The approximation method is used to construct polar codes for both single-user and multiple-access channels with prime input alphabet sizes.

Original language	English
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	2132-2136
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6283739
State	Published - 2012
Externally published	Yes
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: 1 Jul 2012 → 6 Jul 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Conference

Conference	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	1/07/12 → 6/07/12

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2012.6283739

Cite this

@inproceedings{84062347c509408d8fd3206749c99768,

title = "Constructing polar codes for non-binary alphabets and MACs",

abstract = "Consider a channel with an input alphabet that is finite but not necessarily binary. A method for approximating such a channel having a large output alphabet size by a degraded version of it having a smaller output alphabet size is presented and analyzed. The approximation method is used to construct polar codes for both single-user and multiple-access channels with prime input alphabet sizes.",

author = "Ido Tal and Artyom Sharov and Alexander Vardy",

year = "2012",

doi = "10.1109/ISIT.2012.6283739",

language = "الإنجليزيّة",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2132--2136",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

Tal, I, Sharov, A & Vardy, A 2012, Constructing polar codes for non-binary alphabets and MACs. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6283739, IEEE International Symposium on Information Theory - Proceedings, pp. 2132-2136, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/07/12. https://doi.org/10.1109/ISIT.2012.6283739

Constructing polar codes for non-binary alphabets and MACs. / Tal, Ido; Sharov, Artyom; Vardy, Alexander.
2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. p. 2132-2136 6283739 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Constructing polar codes for non-binary alphabets and MACs

AU - Tal, Ido

AU - Sharov, Artyom

AU - Vardy, Alexander

PY - 2012

Y1 - 2012

N2 - Consider a channel with an input alphabet that is finite but not necessarily binary. A method for approximating such a channel having a large output alphabet size by a degraded version of it having a smaller output alphabet size is presented and analyzed. The approximation method is used to construct polar codes for both single-user and multiple-access channels with prime input alphabet sizes.

AB - Consider a channel with an input alphabet that is finite but not necessarily binary. A method for approximating such a channel having a large output alphabet size by a degraded version of it having a smaller output alphabet size is presented and analyzed. The approximation method is used to construct polar codes for both single-user and multiple-access channels with prime input alphabet sizes.

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

U2 - 10.1109/ISIT.2012.6283739

DO - 10.1109/ISIT.2012.6283739

M3 - منشور من مؤتمر

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2132

EP - 2136

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

Constructing polar codes for non-binary alphabets and MACs

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this