Capacity-achieving polar codes for arbitrarily permuted parallel channels

Eran Hof; Igal Sason; Shlomo Shamai Shitz; Chao Tian

doi:https://doi.org/10.1109/TIT.2012.2236971

Capacity-achieving polar codes for arbitrarily permuted parallel channels

Eran Hof, Igal Sason, Shlomo Shamai Shitz, Chao Tian

Electrical and Computer Engineering

Technion - Israel Institute of Technology

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

Abstract

Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric.

Original language	English
Article number	6399602
Pages (from-to)	1505-1516
Number of pages	12
Journal	IEEE Transactions on Information Theory
Volume	59
Issue number	3
DOIs	https://doi.org/10.1109/TIT.2012.2236971
State	Published - 2013

Keywords

Capacity-achieving codes
maximum distance separable (MDS) codes
parallel channels
polar codes
stochastically degraded channels

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

https://doi.org/10.1109/TIT.2012.2236971

Cite this

@article{c2977fff8e6e496d97d483513e255e1e,

title = "Capacity-achieving polar codes for arbitrarily permuted parallel channels",

abstract = "Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric.",

keywords = "Capacity-achieving codes, maximum distance separable (MDS) codes, parallel channels, polar codes, stochastically degraded channels",

author = "Eran Hof and Igal Sason and Shitz, {Shlomo Shamai} and Chao Tian",

year = "2013",

doi = "https://doi.org/10.1109/TIT.2012.2236971",

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

volume = "59",

pages = "1505--1516",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "3",

}

TY - JOUR

T1 - Capacity-achieving polar codes for arbitrarily permuted parallel channels

AU - Hof, Eran

AU - Sason, Igal

AU - Shitz, Shlomo Shamai

AU - Tian, Chao

PY - 2013

Y1 - 2013

N2 - Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric.

AB - Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric.

KW - Capacity-achieving codes

KW - maximum distance separable (MDS) codes

KW - parallel channels

KW - polar codes

KW - stochastically degraded channels

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

U2 - https://doi.org/10.1109/TIT.2012.2236971

DO - https://doi.org/10.1109/TIT.2012.2236971

M3 - مقالة

SN - 0018-9448

VL - 59

SP - 1505

EP - 1516

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

M1 - 6399602

ER -

Capacity-achieving polar codes for arbitrarily permuted parallel channels

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this