Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination

Min Jang; Seok Ki Ahn; Hongsil Jeong; Kyung Joong Kim; Seho Myung; Sang Hyo Kim; Kyeongcheol Yang

doi:10.1109/ISIT.2019.8849450

Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination

Min Jang
, Seok Ki Ahn
, Hongsil Jeong
, Kyung Joong Kim
, Seho Myung
, Sang Hyo Kim
, Kyeongcheol Yang

Department of Electronic and Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1767-1771
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849450
State	Published - Jul 2019
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July
ISSN (Print)	2157-8095

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

Access to Document

10.1109/ISIT.2019.8849450

Cite this

Jang, M., Ahn, S. K., Jeong, H., Kim, K. J., Myung, S., Kim, S. H., & Yang, K. (2019). Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 1767-1771). Article 8849450 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849450

@inproceedings{0017a8e3cc4344199f45dfdcfc1fb401,

title = "Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination",

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.",

author = "Min Jang and Ahn, \{Seok Ki\} and Hongsil Jeong and Kim, \{Kyung Joong\} and Seho Myung and Kim, \{Sang Hyo\} and Kyeongcheol Yang",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849450",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1767--1771",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

}

Jang, M, Ahn, SK, Jeong, H, Kim, KJ, Myung, S, Kim, SH & Yang, K 2019, Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849450, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 1767-1771, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849450

Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination. / Jang, Min; Ahn, Seok Ki; Jeong, Hongsil et al.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 1767-1771 8849450 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination

AU - Jang, Min

AU - Ahn, Seok Ki

AU - Jeong, Hongsil

AU - Kim, Kyung Joong

AU - Myung, Seho

AU - Kim, Sang Hyo

AU - Yang, Kyeongcheol

PY - 2019/7

Y1 - 2019/7

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85073146229

U2 - 10.1109/ISIT.2019.8849450

DO - 10.1109/ISIT.2019.8849450

M3 - Conference contribution

AN - SCOPUS:85073146229

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1767

EP - 1771

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Jang M, Ahn SK, Jeong H, Kim KJ, Myung S, Kim SH et al. Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 1767-1771. 8849450. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2019.8849450

Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this