Name
Abstract | ||
|---|---|---|
Automorphism ensemble (AE) decoding for polar codes was proposed by decoding permuted codewords with successive cancellation (SC) decoders in parallel and hence has lower latency compared to that of successive cancellation list (SCL) decoding. However, some automorphisms are SC-invariant, thus are redundant in AE decoding. In this paper, we find a necessary and sufficient condition related to the block lower-triangular structure of transformation matrices to identify SC-invariant automorphisms. Furthermore, we provide an algorithm to determine the complete SC-invariant affine automorphisms under a specific polar code construction. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/ISIT50566.2022.9834828 | International Symposium on Information Theory (ISIT) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zicheng Ye | 1 | 0 | 0.34 |
| Yuan Li | 2 | 0 | 1.01 |
| Huazi Zhang | 3 | 0 | 0.34 |
| Rong Li | 4 | 1 | 5.76 |
| Jun Wang | 5 | 110 | 42.73 |
| Guiying Yan | 6 | 11 | 1.63 |
| Zhiming Ma | 7 | 0 | 0.68 |