New Partial Orders of Polar Codes for BMSC
Abstract: In this paper, we define partial orders (POs) of polar codes based on the Bhattacharyya parameter and the bit-error probability, respectively. These POs are applicable to arbitrary binary memoryless symmetric channel (BMSC). Leveraging the extremal inequalities of polarization transformation, we derive new POs for BMSC based on the corresponding POs observed in the Binary Erasure Channel (BEC). %Additionally, we discover more special POs in the Binary Symmetric Channel (BSC). We provide examples that demonstrate the inability of existing POs to deduce these novel POs. Furthermore, we establish upper bounds for the expansion parameter $\beta$ if the polar codes constructed by $\beta$-expansion method obey these POs.
- E. Arikan. Channel polarization: A method for constructing capacity-achieving codes. In 2008 IEEE International Symposium on Information Theory, pages 1173–1177, 2008.
- Performance of polar codes with the construction using density evolution. In IEEE Communications Letters, 13(7):519–521, 2009.Â
- P. Trifonov. Efficient Design and Decoding of Polar Codes. In IEEE Transactions on Communications, 60(11):3221-3227, 2012.
- Beta-expansion: A theoretical framework for fast and recursive construction of polar codes. In 2017 IEEE Global Communications Conference, pages 1–6, 2017.
- I.Tal and A. Vardy. How to construct polar codes. In IEEE Transactions on Information Theory, 59(10):6562–6582, 2011.
- J. Muramatsu. Binary polar codes based on bit error probability. In 2022 IEEE International Symposium on Information Theory, pages 2148–2153, 2022.
- C. Schurch. A partial order for the synthesized channels of a polar code. In 2016 IEEE International Symposium on Information Theory, pages 220–224, 2016.
- W. Wu and P. H. Siegel. Generalized partial orders for polar code bit-channels. In IEEE Transactions on Information Theory, 65(11):7114–7130, 2019.
- Optimal self-dual inequalities to order polarized BEC. In 2023 IEEE International Symposium on Information Theory, pages 1550–1555, 2023.
- Density devolution for ordering synthetic channels. In 2023 IEEE International Symposium on Information Theory, pages 1544–1549, 2023.
- Fast methods for ranking synthetic BEC. In 2023 IEEE International Symposium on Information Theory, pages 1562–1567, 2023.
- Modern coding theory. Cambridge University Press, 2008.
- Relaxed polar codes. In IEEE Transactions on Information Theory, 63(4):1986–2000, 2017.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.