Shannon’s monumental 1948 work laid the foundations for the rich fields of information andcoding theory. The quest for efficient coding schemes to approach Shannon capacity has occupiedresearchers ever since, with spectacular progress enabling the widespread use of error-correctingcodes in practice. Yet the theoretical problem of approaching capacity arbitrarily closely withpoly...

We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.

Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. This description allows an easy development of the first two algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also describ...

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the stateof-the-art low-complexity decoding algorithm can be improved to better accommodate low-rate codes. More constituent codes are recognized in the updated algorithm and dedicated hardware is added to efficiently decode these ...

In this paper, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for interference channels rely on the use of polar codes for the multiple access channel, the code construction problem of which can be complicated. We show that the w...

Polar coding is a new technique introduced by Arıkan [1] based on a phenomenon called channel polarization. Polar codes are appealing as an error correction method since they are proved to achieve the symmetric capacity of any B-DMC using low complexity encoders and decoders, and their block error probability is shown to decrease exponentially in the square root of the block length. In fact, tw...

Polar codes approach channel capacity provably and empirically are thereby a constituent code of the 5G standard. Compared to low-density parity-check codes, however, performance short-length polar have rooms for improvement that could hinder its adoption by wider class applications. As part program addresses issue at short length, it is crucial understand how fast binary memoryless symmetric c...