Results 1 to 10 of about 15,938 (213)
List Decoding of Arıkan's PAC Codes. [PDF]
Entropy (Basel), 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 is far from optimal.
Yao H, Fazeli A, Vardy A.
europepmc +7 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
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 +2 more
openaire +5 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
Efficient list-decoding with constant alphabet and list sizes [PDF]
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021 We present an explicit and efficient algebraic construction of capacity-achieving list decodable codes with both constant alphabet and constant list sizes. More specifically, for any $R \in (0,1)$ and $ >0$, we give an algebraic construction of an infinite family of error-correcting codes of rate $R$, over an alphabet of size $(1/ )^{O(1/ ^2 ...
Zeyu Guo, Noga Ron-Zewi
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.
Dinur, Irit +4 more
openaire +4 more sources