Successive cancellation flip decoding requires a large number of extra successive attempts at low signal-to-noise ratios (SNRs), resulting in high complexity. In addition, it has long latency. Although modifications have been proposed decoding, these still computational complexity SNRs due to huge additional attempts. It is desirable detect the unsuccessful process an early stage and stop that ...

This paper presents polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton’s region with both common and private messages. This is the best achievable rate region up to date, and it is tight for all classes of 2-user DM-BCs whose capacity regions are known. To accomplish this task, first we construct polar codes for the superposition and binning s...

In this paper, we study the symmetry of polar codes on symmetric binary-input discrete memoryless channels (B-DMC). The symmetry property of polar codes is originally pointed out in Arikan’s work for general B-DMC channels. With the symmetry, the output vector y 1 (N be the block length) can be divided into equivalence classes in terms of their transition probabilities. In this paper, we presen...

— This paper proposes an algorithm to search a family of multiple sets of minimum correlated one dimensional uni-polar (optical) orthogonal codes (1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code parameters. The cardinality of each set is equal to upper bound. The codes within a set can be searched for general values of code length 'n', code weight 'w', auto-correla...

We introduce a new class of circuits for constructing efficiently decodable error-correction codes, based on a recently discovered contractible tensor network [1]. We perform an indepth study of a particular example that can be thought of as an extension to Arikan’s polar code [2]. Notably, our numerical simulation show that this code polarizes the logical channels more strongly while retaining...

In this paper, we propose a Polar coding scheme for parallel Gaussian channels. The encoder knows the sum rate of the parallel channels but does not know the rate of any channel. By using the nesting property of Polar code, we design a coding/decoding scheme to achieve the sum rates. Keywords-Polar codes; Paralle Gaussian channels.

A new family of codes based on polar codes, soft concatenation and list+CRC decoding is proposed. Numerical experiments show the performance competitive with industry standards and Tal, Vardy approach.

We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacityachieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme. OCIS codes: (270.5585); (270.5565).