Results 31 to 40 of about 184,809 (276)
Reed-Muller Codes Polarize [PDF]
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019 Reed-Muller (RM) codes and polar codes are generated by the same matrix $G_m= \bigl[\begin{smallmatrix}1 & 0 \\ 1 & 1 \\ \end{smallmatrix}\bigr]^{\otimes m}$ but using different subset of rows. RM codes select simply rows having largest weights.
Emmanuel Abbe, Min Ye
openaire +2 more sources
Polar codes: Encoding/decoding and rate-compatible jointly design for HARQ system
Intelligent and Converged Networks, 2021 Polar coding are the first class of provable capacity-achieving coding techniques for a wide range of channels. With an ideal recursive structure and many elegant mathematical properties, polar codes are inherently implemented with low complexity ...
Qiaoli Zeng +5 more
doaj +1 more source
Modified pilot selection for channel estimation of systematic polar coded MIMO-OFDM
ICT Express, 2019 This paper proposes a modified pilot selection for channel estimation of systematic polar coded MIMO-OFDM. Polar codes provably achieve the theoretical limit for communication systems and systematic polar codes generate the codeword that has the same ...
Koya Watanabe +5 more
doaj +1 more source
List Decoding of Arıkan’s PAC Codes
Entropy, 2021 Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding
Hanwen Yao +2 more
doaj +1 more source
An efficient length- and rate-preserving concatenation of polar and repetition codes
, 2013 We improve the method in \cite{Seidl:10} for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes.
Huber, Johannes B., Seidl, Mathis
core +1 more source
Polar Codes for Broadcast Channels [PDF]
IEEE Transactions on Information Theory, 2013 Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while satisfying broadcast constraints.
Naveen Goela +2 more
openaire +2 more sources
Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders
, 2017 Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not ...
Balatsoukas-Stimming, Alexios +2 more
core +1 more source
Low Complexity List Decoding for Polar Codes with Multiple CRC Codes
Entropy, 2017 Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity.
Jong-Hwan Kim +3 more
doaj +1 more source
Polar-Coded Transmission over 7.8-km Terrestrial Free-Space Optical Links
Photonics, 2023 Free-space optical (FSO) communications can offer high-capacity transmission owing to the properties of the laser beams. However, performance degradation caused by atmospheric turbulence is an urgent issue. Recently, the application of polar codes, which
Shingo Fujita +8 more
doaj +1 more source
Usage of polar codes for fixed and random length error bursts correction
Научно-технический вестник информационных технологий, механики и оптикиError correction during data storage, processing, and transmission allows for ensuring data integrity. Channel coding techniques are used to counteract these errors.
A. A. Ovchinnikov
doaj +1 more source