Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.22896 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908614146392064 |
|---|---|
| author | Jiao, Yadong Cheng, Xiaoyan Tang, Yuansheng Xu, Ming |
| author_facet | Jiao, Yadong Cheng, Xiaoyan Tang, Yuansheng Xu, Ming |
| contents | The polar codes introduced by Arikan in 2009 achieve the capacity of binary-input discrete memoryless channels (BIDMCs) with low complexity encoding and decoding. Identifying the unreliable synthetic channels, generated by Arikan transformation during the construction of these polar codes, is crucial. Currently, because of the large size of the output alphabets of synthetic channels, there is no efficient and practical approach to evaluate their reliability in general. To tackle this problem, by converting the generation of synthetic channels in polar code construction into algebraic operations, in this paper we develop a method to characterize the synthetic channels as random switching channels of binary symmetric channels when the underlying channels are symmetric. Moreover, a lower bound for the average number of elements that possess the same likelihood ratio within the output alphabet of any synthetic channel generated in polar codes is also derived. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_22896 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Arikan Transformations of Binary-Input Discrete Memoryless Channels Jiao, Yadong Cheng, Xiaoyan Tang, Yuansheng Xu, Ming Information Theory The polar codes introduced by Arikan in 2009 achieve the capacity of binary-input discrete memoryless channels (BIDMCs) with low complexity encoding and decoding. Identifying the unreliable synthetic channels, generated by Arikan transformation during the construction of these polar codes, is crucial. Currently, because of the large size of the output alphabets of synthetic channels, there is no efficient and practical approach to evaluate their reliability in general. To tackle this problem, by converting the generation of synthetic channels in polar code construction into algebraic operations, in this paper we develop a method to characterize the synthetic channels as random switching channels of binary symmetric channels when the underlying channels are symmetric. Moreover, a lower bound for the average number of elements that possess the same likelihood ratio within the output alphabet of any synthetic channel generated in polar codes is also derived. |
| title | On the Arikan Transformations of Binary-Input Discrete Memoryless Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2510.22896 |