Polar codes have attracted the attention of academia and industry alike in the past decade,
such that the 5th generation wireless systems (5G) standardization process of the 3rd …

Capacity-achieving polar codes have gained significant attention in recent years. In general,
polar codes can be decoded by either successive cancellation (SC) or the belief …

Consider the transmission of a polar code of block length and rate over a binary memoryless
symmetric channel and let be the block error probability under successive cancellation …

We explore the relationship between polar and RM codes and we describe a coding
scheme which improves upon the performance of the standard polar code at practical block …

Cyclic redundancy check (CRC) assisted list successive cancellation decoding (SCLD)
makes polar codes competitive with the state-of-art codes. In this letter, we try to find the …

Long polar codes can achieve the symmetric capacity of arbitrary binary-input discrete
memoryless channels under a low-complexity successive cancelation (SC) decoding …

This paper presents deep learning (DL) methods to optimize polar belief propagation (BP)
decoding and concatenated LDPC-polar codes. First, two-dimensional offset Min-Sum (2-D …

A scheme for concatenating the recently invented polar codes with non-binary MDS codes,
as Reed-Solomon codes, is considered. By concatenating binary polar codes with …

We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to
codes that not only approach the Shannon limit but do so under the best possible scaling of …

Data availability (DA) attack is a well-known problem in certain blockchains where users
accept an invalid block with unavailable portions. Previous works have used LDPC and 2-D …