Recently, Arıkan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel. In the thesis, we show that decoding algorithm of polar codes, called successive cancellation decoding, can be regarded as belief propagation decoding, which has been used for decoding of low-density parity-...

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, polar codes for the -user multiple access channel (MAC)with binary inputs are constructed. It is shown that Arikan’’s polarization technique applied individually to each user transforms independent uses of an -user binary input MAC into successive uses of extremal MACs. This transformation has a number of desirable properties: 1) the ““uniform sum-rate”” of the original MAC is ...

In this paper, we propose a rate-compatible (RC) parallel concatenated punctured polar (PCPP) codes for incremental redundancy hybrid automatic repeat request (IR-HARQ) transmission schemes, which can transmit multiple data blocks over a time-varying channel. The PCPP coding scheme can provide RC polar coding blocks in order to adapt to channel variations. First, we investigate an improved rand...

Gopalan, Klivans, and Zuckerman proposed a list-decoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using wellknown Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a natural genera...

The polar codes are a class of linear block error-correcting codes transmitted over symmetric binaryinput discrete memoryless channels [1, 2, 3]. As their length N, N = 2n, increases, their performance tends to the Shannon limit. Subsequent publications (e.g., [4, 5]) have addressed practical aspects of the polar codes such as the size length, N, of a polar code that can support a specific feas...

Flexibility is one mandatory aspect of channel coding in modern wireless communication systems. Among other things, the channel decoder has to support several code lengths and code rates. This need for flexibility applies to polar codes that are considered for control channels in the future 5G standard. This paper presents a new generic and flexible implementation of a software Successive Cance...

Polar codes were introduced by Arikan [1] in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to...

Following the International Code for Ships Operating in Polar Waters (Polar Code), ships operating ice-covered polar waters must comply with an appropriate Class (PC) or equivalent ice class standard. For selection of Class, ship designers and operators are encouraged to use Operational Limit Assessment Risk Indexing System (POLARIS). A limitation POLARIS is that it does not consider extent whi...

A Magneto Plasma Sail (MPS) produces a propulsive force by the interaction between the solar wind and an artificial magnetic field inflated by a plasma jet injection. Using a 2D hybrid PIC simulation code, the parametric study of magnetic inflation by the plasma jet injection is performed under different realistic parameters in terms of plasma material (Ar/Xe) and injection direction. We evalua...