Results 11 to 20 of about 184,294 (277)
Concatenated Polar Codes [PDF]
Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems.
Bakshi, Mayank +2 more
core +6 more sources
Serially Concatenated Polar Codes
Simulation results show that the performance of polar codes is improved vastly by using polar codes as inner codes in serially concatenated coding schemes.
Erdal Arikan
doaj +3 more sources
Polar Codes’ Simplicity, Random Codes’ Durability [PDF]
Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively, for any constants $ , >0$ such that $ +2 <1$, we construct a sequence of error correction codes with ...
Hsin-Po Wang, Iwan M. Duursma
openaire +2 more sources
A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation (PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded modulation (BICM). The conceptual equivalence of polar coding and multilevel coding is pointed out in detail.
Seidl, Mathis +3 more
openaire +2 more sources
Polar codes were originally introduced as a class of non-systematic linear block codes. This paper gives encoding and decoding methods for systematic polar coding that preserve the low-complexity nature of non-systematic polar coding while guaranteeing the same frame error rate.
openaire +5 more sources
A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar codes and then discuss our proposed scheme.
Mahdavifar, Hessam +3 more
openaire +2 more sources
On the Concatenations of Polar Codes and Non-Binary LDPC Codes
An interleaved concatenation scheme of polar codes with non-binary low-density parity check (NBLDPC) codes is proposed in this paper to improve the error-correcting performance of polar codes with finite code length. The information blocks of inner polar
Qingping Yu +5 more
doaj +1 more source
Two examples are presented to illustrate the advantages of polarization coded apertures, in which the incoming light will rotate its polarization at a portion of an aperture. In the first example the depth of field of a diffraction limited lens is increased without sacrificing the light throughput; in the second example the axial focal intensity of a ...
Wanli, Chi +2 more
openaire +2 more sources
Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless output-symmetric channel. One of the few drawbacks of the original polar code construction is that it is not universal. This means that the code has to be tailored to the channel if we want to transmit close to capacity. We present two "polar-like"
Hassani, S. Hamed, Urbanke, Rudiger
openaire +2 more sources
High Performance Short Polar Codes: A Concatenation Scheme Using Spinal Codes as the Outer Code
An innovative scheme for concatenating the polar codes with the recently proposed spinal codes is presented in this paper. The primary objective is to improve the performance of the polar codes in the finite-length regime.
Xiao Xu +4 more
doaj +1 more source

