Results 11 to 20 of about 19,174 (291)
List Decoding of Arıkan’s PAC Codes [PDF]
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 +10 more sources
Improved Adaptive Successive Cancellation List Decoding of Polar Codes [PDF]
Entropy, 2019 Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the ...
Xiumin Wang +5 more
doaj +3 more sources
Generalized List Decoding [PDF]
2020 Information Theory and Applications Workshop (ITA), 2019 This paper concerns itself with the question of list decoding for general adversarial channels, e.g., bit-flip (XOR) channels, erasure channels, AND (Z-) channels, OR channels, real adder channels, noisy typewriter channels, etc.
Zhang, Yihan +6 more
core +6 more sources
Discrete Mathematics, 1992 A wide range of problems and both old and new methods are discussed that arise when the technique of list decoding is applied to various concrete situations.First, some asymptotic bounds are derived on the maximum cardinality of these codes. Next, bounds
V.M. Blinovsky, Blinovsky, V.M.
core +2 more sources
List decoding: algorithms and applications [PDF]
ACM SIGACT News, 2000 Over the years coding theory and complexity theory have bene ted from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the
Madhu Sudan
core +2 more sources
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,
Ruano Benito, Diego +5 more
core +6 more sources
IEEE Information Theory Workshop, 2005., 2005 We analyze the relation between iterative decoding and the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and the ...
Hjaltason, Johan +5 more
core +3 more sources
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 2002 A list sequence (LS) maximum a posteriori probability (MAP) decoding algorithm for convolutional codes, that takes into account bitwise a priori probabilities and produces a rank ordered list of [script L] sequence MAP estimates, can be obtained by ...
Sundberg, Carl-Erik W. +2 more
core +3 more sources
On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes [PDF]
IEEE Transactions on Information Theory, 2013 We derive the Wu list-decoding algorithm for generalized Reed–Solomon (GRS) codes by using Gröbner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp–Massey algorithm.
Wu, Yingquan +3 more
core +5 more sources
An Improved
IEEE Access, 2018 Comparing with hard decision decoding algorithms, soft decoding has a lower probability of bit error but a higher computational complexity. As a maximum-likelihood soft decoding method, the A* algorithm is the most basic and widely used to minimize bit ...
Bin Xu, Chenhao Ying, Yuan Luo
doaj +2 more sources