Abstract
Polar codes are normally constructed based on the reliability of the sub-channels in the polarized vector channel. Code construction based on reliability is compatible with successive cancellation decoding. However, due to poor Hamming distance properties, the designed codes cannot perform well with near maximum likelihood decoders. In this work, we propose a new approach that modifies polar codes and PAC codes to significantly lower the number of codewords with minimum distance (a.k.a. error coefficient). This approach is based on the recognition of all the rows of polar transform involved in the formation of the minimum-weight codewords. The numerical results show that the designed codes outperform polar codes and PAC codes under list decoding.
Original language | English |
---|---|
Title of host publication | 2022 IEEE Information Theory Workshop (ITW 2022) |
Editors | Pradeep Sarvepalli, Lakshmi Prasad Natarajan |
Place of Publication | Piscataway NJ USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 249-254 |
Number of pages | 6 |
ISBN (Electronic) | 9781665483414 |
ISBN (Print) | 9781665483421 |
DOIs | |
Publication status | Published - 2022 |
Event | Information Theory Workshop 2022 - Mumbai, India Duration: 1 Nov 2022 → 9 Nov 2022 Conference number: 1st https://ieeexplore.ieee.org/xpl/conhome/9965754/proceeding (Proceedings) https://itw2022.in/ (Website) |
Conference
Conference | Information Theory Workshop 2022 |
---|---|
Abbreviated title | ITW 2022 |
Country/Territory | India |
City | Mumbai |
Period | 1/11/22 → 9/11/22 |
Internet address |
|
Keywords
- code construction
- list decoding
- minimum Hamming distance
- PAC codes
- Polar codes
- weight distribution