Rate-compatible systematic polar codes

[1]  Kyeongcheol Yang,et al.  Design of Length-Compatible Polar Codes Based on the Reduction of Polarizing Matrices , 2013, IEEE Transactions on Communications.

[2]  Yuping Zhao,et al.  A Mapping Shortening Algorithm for Polar Codes , 2019, IEEE Access.

[3]  Liping Li,et al.  On the encoding complexity of systematic polar codes , 2015, 2015 28th IEEE International System-on-Chip Conference (SOCC).

[4]  Qinyu Zhang,et al.  An Efficient Rateless Scheme Based on the Extendibility of Systematic Polar Codes , 2017, IEEE Access.

[5]  Yan Chen,et al.  On the puncturing patterns for punctured polar codes , 2014, 2014 IEEE International Symposium on Information Theory.

[6]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.

[7]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[8]  Alexander Vardy,et al.  List Decoding of Polar Codes , 2015, IEEE Transactions on Information Theory.

[9]  Kai Chen,et al.  Distance spectrum analysis of polar codes , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[10]  Valerio Bioglio,et al.  Design of Polar Codes in 5G New Radio , 2018, IEEE Communications Surveys & Tutorials.

[11]  Norifumi Kamiya,et al.  On the Properties of Bit-Reversal Shortening in Polar Codes , 2018, 2018 International Symposium on Information Theory and Its Applications (ISITA).

[12]  Hui Li,et al.  Systematic Polar Codes Based on 3x3 Kernel Matrix , 2019, 2019 International Conference on Communications, Information System and Computer Engineering (CISCE).

[13]  Kai Chen,et al.  Capacity-achieving rateless polar codes , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).

[14]  Valerio Bioglio,et al.  Low-Complexity Puncturing and Shortening of Polar Codes , 2017, 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

[15]  Peter Trifonov,et al.  Efficient Design and Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

[16]  Xiao Ma,et al.  New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes , 2011, IEEE Transactions on Communications.

[17]  Jun Wang,et al.  Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[18]  Alexios Balatsoukas-Stimming,et al.  LLR-Based Successive Cancellation List Decoding of Polar Codes , 2013, IEEE Transactions on Signal Processing.

[19]  Alexander Vardy,et al.  Fast Polar Decoders: Algorithm and Implementation , 2013, IEEE Journal on Selected Areas in Communications.

[20]  Yi Hong,et al.  A Comparative Study of Polar Code Constructions for the AWGN Channel , 2015, ArXiv.

[21]  Dennis Hui,et al.  Capacity-achieving rate-compatible polar codes , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).

[22]  Kai Chen,et al.  Beyond turbo codes: Rate-compatible punctured polar codes , 2013, 2013 IEEE International Conference on Communications (ICC).

[23]  Erdal Arikan,et al.  Systematic Polar Coding , 2011, IEEE Communications Letters.

[24]  Ivana Maric,et al.  Capacity-Achieving Rate-Compatible Polar Codes for General Channels , 2016, 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

[25]  Bin Li,et al.  An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check , 2012, IEEE Communications Letters.

[26]  Rongke Liu,et al.  A Novel Puncturing Scheme for Polar Codes , 2014, IEEE Communications Letters.

[27]  Satoshi Nagata,et al.  Performance evaluation of rate-compatible polar codes using puncturing/shortening , 2017, 2017 20th International Symposium on Wireless Personal Multimedia Communications (WPMC).