Results 11 to 20 of about 177,188 (278)
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 ($\textsf{XOR}$) channels, erasure channels, $\textsf{AND}$ ($Z$-) channels, $\textsf{OR}$ channels, real adder channels, noisy typewriter ...
Budkuley, Amitalok J. +2 more
core +7 more sources
Symmetric Disjunctive List-Decoding Codes [PDF]
Designs, Codes and Cryptography, 2015 A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \ge 2$, $L \ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets can cover not ...
D'yachkov, Arkadii +3 more
core +4 more sources
Combinatorial limitations of average-radius list-decoding [PDF]
IEEE Transactions on Information Theory, 2013 We study certain combinatorial aspects of list-decoding, motivated by the exponential gap between the known upper bound (of $O(1/\gamma)$) and lower bound (of $\Omega_p(\log (1/\gamma))$) for the list-size needed to decode up to radius $p$ with rate ...
Guruswami, Venkatesan +1 more
core +3 more sources
Algebraic List-decoding of Subspace Codes [PDF]
IEEE Transactions on Information Theory, 2012 Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case).
Mahdavifar, Hessam, Vardy, Alexander
core +2 more sources
PAC Codes: Sequential Decoding vs List Decoding [PDF]
IEEE Transactions on Vehicular Technology, 2023 In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arıkan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called polarization-adjusted convolutional (PAC) codes. In this scheme, a pair of polar mapper and demapper
Mohammad Rowshan +2 more
openaire +4 more sources
List-decodable covariance estimation
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022 Abstract slightly clipped.
Ivkov, Misha, Kothari, Pravesh K.
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.
J. Justesen, T. Hoholdt, J. Hjaltason
openaire +3 more sources
Secure codes with list decoding
2022 IEEE International Symposium on Information Theory (ISIT), 2022 20 ...
Yujie Gu, Ilya Vorobyev, Ying Miao
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 Decoding Barnes-Wall Lattices [PDF]
2012 IEEE 27th Conference on Computational Complexity, 2012 The question of list decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete structure of linear codes and point lattices in R^N, and their many shared applications across complexity theory, cryptography, and coding theory, we initiate the study of list ...
Grigorescu, Elena, Peikert, Chris
openaire +3 more sources