Studying the Binary Erasure Polarization Subchannels Using Network Reliability
In this article we analyze the reliability of the synthetic channels of a polar code designed for the binary erasure channel, and in particular the properties of their Bhattacharyya parameter. We apply techniques from network theory in order to establish fresh results. Firstly, we show how to effici...
Saved in:
Published in | IEEE communications letters Vol. 24; no. 1; pp. 62 - 66 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.01.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this article we analyze the reliability of the synthetic channels of a polar code designed for the binary erasure channel, and in particular the properties of their Bhattacharyya parameter. We apply techniques from network theory in order to establish fresh results. Firstly, we show how to efficiently approximate the Bhattacharyya parameter. Secondly, we identify asymptotically "good" channels for polar code. Thirdly, we determine a range of values for the erasure probability for which the selecting rule for the polar codes construction coincides with that of the Reed-Muller codes. |
---|---|
ISSN: | 1089-7798 1558-2558 |
DOI: | 10.1109/LCOMM.2019.2947910 |