Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination
- Authors
- Jang, M[Jang, Min]; Ahn, SK[Ahn, Seok-Ki]; Jeong, H[Jeong, Hongsi]; Kim, KJ[Kim, Kyung-Joong]; Myung, S[Myung, Seho]; Kim, SH[Kim, Sang-Hyo]; Yang, K[Yang, Kyeongcheol]
- Issue Date
- 2019
- Publisher
- IEEE
- Citation
- 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), pp.1767 - 1771
- Journal Title
- 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
- Start Page
- 1767
- End Page
- 1771
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/95143
- Abstract
- In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination which plays a key role in polar code construction. We first prove that the orders of encoder input bits to be made incapable (by puncturing) or to be shortened are governed by binary domination. In particular, we show that binary domination completely determines incapable or shortened bit patterns for polar codes, and that all the possible incapable or shortened bit patterns can be identified. We then present the patterns of the corresponding encoder output bits to be punctured or fixed, when the incapable or shortened bits are given.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Information and Communication Engineering > School of Electronic and Electrical Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/95143)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.