Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
- 期刊名称IEEE Transactions on Information Theory
- 作者Hof, Eran; Sason, Igal; Shamai, Shlomo; Tian, Chao
- 卷第59卷
- 期第3期
- 印刷ISSN0018-9448
- 电子ISSN1557-9654
- 文件大小218.15KB
- 发表时间2013-03
- DOI10.1109/tit.2012.2236971
- 页码1505-1516
同作者推荐
Strategic Coloring of a GraphEscoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme · Internet Mathematics · 2012
The Price of Optimum: Complexity and Approximation for a Matching GameEscoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme · Algorithmica · 2017
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximationBruno Escoffier; Laurent Gourvès; Jérôme Monnot; Olivier Spanjaard · 2010
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphsBruno Escoffier; Laurent Gourvès; Jérôme Monnot · 2010