1. Introduces techniques to construct binary polar source/channel codes based on the bit error probability of successive-cancellation decoding.
2. Presents novel loss functions for a greedy degrading-/upgrading-merge algorithm and evaluates the degrading/upgrading loss after a single polar transform.
3. Describes the (block) decoding error probability for both polar source and channel codes.
The article is generally reliable and trustworthy, as it provides detailed information about the techniques used to construct binary polar source/channel codes based on the bit error probability of successive-cancellation decoding, as well as novel loss functions for a greedy degrading-/upgrading-merge algorithm and evaluation of the degrading/upgrading loss after a single polar transform. The article also presents clear definitions and notations that are used throughout the paper, which makes it easier to understand the concepts discussed in the paper.
The article does not appear to be biased or one-sided, as it presents both sides of an argument equally and does not make any unsupported claims or omit any points of consideration. Furthermore, all claims made in the paper are supported by evidence, such as references to previous works in this field. The article also does not contain any promotional content or partiality towards any particular point of view.
The only potential issue with this article is that it does not discuss any possible risks associated with using these techniques, such as potential security risks or other unintended consequences that could arise from their use. However, this is likely due to space constraints rather than intentional omission, so it should not be seen as a major issue with the reliability of this article.