onstructing a polar code means using a vector of bit-channel indices that would be used to transmit information. The rest of the bit-channels would have no data and contain the frozen bits. Several code construction algorithms that vary in complexity, precision, and BER performance exist which include evolution of Z-parameters-base code construction algorithm; Monte-Carlo simulation-based construction algorithm; density evolution-based code construction algorithm; Gaussian approximation-based algorithm; and transition proba- bility matrix-based algorithm [29]. Polar codes are a member of the coset 10 linear block code family, where the information are multiplied by a submatrix out of the traditional polar generator matrix, and the fro- zen bits are multiplied by another submatrix. Polar encoding is characterized by its struc- tural manner, in the sense that all parameters are static, independent of the code rate. Different code rates correspond to different number of information bits, while using the same generator matrix. The systematic polar encoding is an extended version of the nonsys- tematic polar encoding, where the codeword is first non-systematically encoded, bits at frozen bit-channel positions are reset to the values of the frozen bits, and then non- systematically encoded. Systematic encoding provides better performance in terms of BER than non-systematic encoding. However, both have the same BLER performance. There are various polar decoding algorithms including SC, SC list (SCL), SCL with (SCL-CRC), and BP. The SC decoder is based on the concept of successively decoding bits, where each stage of bit decoding is based on previously decoded bits. It suffers from inter-bit dependence due to its successive nature and thus error propagation. As a standalone decoder for polar codes, it is outperformed by most polar decoders in terms of BER performance. However, it enjoys a For a subgroup H of a group G and an element X of G, define xH to be the set {xh:he H} and Hx to be the set {hx:heH}. A subset of G in