A Mapping Shortening Algorithm for Polar Codes
Shortening is a common way to achieve rate-compatible polar codes. The existing shortening algorithms select shortened bits merely according to the structure of the generator matrix in order to make them known by the receiver. In this paper, we take into account the effect that the shortening has on...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8755301/ |