Results 11 to 20 of about 33,394 (159)
A Note on the Mixing Factor of Polar Codes [PDF]
Entropy, 2023 Over binary-input memoryless symmetric (BMS) channels, the performance of polar codes under successive cancellation list (SCL) decoding can approach maximum likelihood (ML) algorithm when the list size L is greater than or equal to 2MF, where MF, known ...
Keer Wei, Xiaoyu Jin, Weihua Yang
doaj +2 more sources
Serially Concatenated Polar Codes
IEEE Access, 2018 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
On Training Neural Network Decoders of Rate Compatible Polar Codes via Transfer Learning [PDF]
Entropy, 2020 Neural network decoders (NNDs) for rate-compatible polar codes are studied in this paper. We consider a family of rate-compatible polar codes which are constructed from a single polar coding sequence as defined by 5G new radios.
Hyunjae Lee +3 more
doaj +2 more sources
Distributed Joint Source-Channel Coding Using Quasi-Uniform Systematic Polar Codes [PDF]
Entropy, 2018 This paper proposes a distributed joint source-channel coding (DJSCC) scheme using polar-like codes. In the proposed scheme, each distributed source encodes source message with a quasi-uniform systematic polar code (QSPC) or a punctured QSPC, and only ...
Liqiang Jin, Hongwen Yang
doaj +2 more sources
Concatenated Polar codes [PDF]
2010 IEEE International Symposium on Information Theory, 2010 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. One significant drawback, however, is that for current constructions the probability of error decays sub-exponentially in the block-length (more detailed ...
Bakshi, Mayank +2 more
openaire +3 more sources
Polar Codes’ Simplicity, Random Codes’ Durability [PDF]
IEEE Transactions on Information Theory, 2021 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
Differential properties of polar codes [PDF]
E3S Web of Conferences, 2023 This paper discusses the features of polar coding as a differential encoder for a binary erasure channel. One of the modern methods of error-correcting coding is polar codes, which has great prospects in the development of current and future wireless ...
Shalin Georgiy +5 more
doaj +1 more source
Low Latency SC Decoder Architecture for Interleaved Polar Codes [PDF]
Radioengineering, 2022 Interleaved polar (I-Polar) codes, a new facet of polar codes to achieve better channel capacity, is designed by placing the interleaver and deinterleaver blocks midway between the stages of the polar codes.
N. Jali, P. Muralidhar, S. R. Patri
doaj
Nonbinary polar coding with low decoding latency and complexity
Journal of Information and Intelligence, 2023 In this paper, we propose a new class of nonbinary polar codes, where the symbol-level polarization is achieved by using a 2 × 2 q-ary matrix 10β1 as the kernel.
Peiyao Chen, Baoming Bai, Xiao Ma
doaj +1 more source
Bidirectional stack decoding of polar codes [PDF]
Vojnotehnički Glasnik, 2021 Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique.
Aleksandar Đ. Minja +2 more
doaj +1 more source