Results 31 to 40 of about 16,915 (258)
In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes
IEEE Access, 2022 Polar codes are the first capacity-achieving error-correction code which has attracted much research attention. Among many decoding methods, successive cancellation list decoding (SCLD) is considered as a representative decoding method that can achieve a
Jaehyeon Park +2 more
doaj +1 more source
List decoding of repeated codes [PDF]
Applicable Algebra in Engineering, Communication and Computing, 2013 Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Although repeated codes are not used for encoding data, due to their parameters, we show that they have a good performance with this algorithm. We compare, by computer simulations,
Fernando Hernando +2 more
openaire +6 more sources
An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes
Mathematics, 2023 Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal.
Desheng Wang +5 more
doaj +1 more source
Behavioral Models for List Decoding [PDF]
Mathematical and Computer Modelling of Dynamical Systems, 2002 Recently it has been shown that list decoding of Reed-Solomon codes may be translated into a bivariate interpolation problem. The data consist of pairs in a finite field and the aim is to find a bivariate polynomial that interpolates the given pairs and is minimal with respect to some criterion.
Kuijper, M., Polderman, Jan W.
openaire +2 more sources
A Low-Complexity Ordered Statistics Decoding Algorithm for Short Polar Codes
Applied Sciences, 2019 In this paper, we propose a low-complexity ordered statistics decoding (OSD) algorithm called threshold-based OSD (TH-OSD) that uses a threshold on the discrepancy of the candidate codewords to speed up the decoding of short polar codes. To determine the
Yusheng Xing, Guofang Tu
doaj +1 more source
On the List Decodability of Insertions and Deletions [PDF]
IEEE Transactions on Information Theory, 2018 In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when insertions occur. Our bound implies that there are binary codes of rate $Ω(1)$ that are list-decodable from a $0.707$-fraction of insertions. For any $τ_\mathsf{I} \geq 0$ and
Tomohiro Hayashi, Kenji Yasunaga
openaire +3 more sources
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Simplified polar code decoding algorithm
Dianzi Jishu Yingyong, 2018 Polar code is an error correction coding technique, which can prove from the mathematical point of view to reach Shannon′s limit. However, the traditional decoding algorithm, such as the successive cancellation(SC) and the successive cancellation list ...
Wang Dan +3 more
doaj +1 more source
Generalizations of Fano’s Inequality for Conditional Information Measures via Majorization Theory
Entropy, 2020 Fano’s inequality is one of the most elementary, ubiquitous, and important tools in information theory. Using majorization theory, Fano’s inequality is generalized to a broad class of information measures, which contains those of Shannon and ...
Yuta Sakai
doaj +1 more source