Results 11 to 20 of about 16,915 (258)
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
Generalized List Decoding [PDF]
2020 Information Theory and Applications Workshop (ITA), 2020 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. We precisely characterize when exponential-sized (or positive rate) (L - 1)-list decodable codes (where the list size L ...
Yihan Zhang 0001 +2 more
openaire +5 more sources
Secure codes with list decoding
2022 IEEE International Symposium on Information Theory (ISIT), 2022 20 ...
Yujie Gu, Ilya Vorobyev, Ying Miao 0001
openaire +2 more sources
IEEE Information Theory Workshop, 2005., 2005 We analyze the relation between iterative decoding and the properties of 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 parameters of the code.
Justesen, Jørn +2 more
openaire +1 more source
List-decodable covariance estimation
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022 Abstract slightly clipped.
Misha Ivkov, Pravesh K. Kothari
openaire +2 more sources
List Decoding with Double Samplers [PDF]
SIAM Journal on Computing, 2019 We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose existence we prove using high dimensional expanders. The ABNNR code construction [IEEE Trans. Inform.
Irit Dinur +4 more
openaire +5 more sources
List decoding of polar codes [PDF]
2011 IEEE International Symposium on Information Theory Proceedings, 2011 We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list decoder, up to $L$ decoding paths are considered concurrently at each decoding stage. Then, a single codeword is selected from the list as output. If the most likely codeword
Ido Tal, Alexander Vardy
openaire +2 more sources
Simplified erasure/list decoding [PDF]
2015 IEEE International Symposium on Information Theory (ISIT), 2015 We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified ...
Nir Weinberger, Neri Merhav
openaire +2 more sources
List decodability at small radii [PDF]
Designs, Codes and Cryptography, 2010 to appear in Designs, Codes, and Cryptography (accepted October 2010)
Yeow Meng Chee +4 more
openaire +4 more sources
The decoding Library for list decoding [PDF]
ACM Communications in Computer Algebra, 2013 The decoding library is a C library whose main goal is to implement as effi- ciently as possible the Guruswami-Sudan algorithm. It is written in C89 and is stand-alone.
openaire +2 more sources