Abstract. This paper is motivated by the program of constructing list-decodable codes with linear-time encoding and decoding algorithms with rate comparable ...
Missing: (Extended | Show results with:(Extended
Abstract. This paper is motivated by the program of constructing list-decodable codes with linear-time encoding and decoding algorithms with rate comparable.
This paper is motivated by the program of constructing list-decodable codes with linear-time encoding and decoding algorithms with rate comparable to or even ...
Bibliographic details on Linear-Time List Decoding in Error-Free Settings: (Extended Abstract).
Jan 1, 2004 · AbstractThis paper is motivated by the program of constructing list-decodable codes with linear-time encoding and decoding algorithms with ...
Missing: (Extended | Show results with:(Extended
Indyk. Linear time list decoding in error-free settings. Proceedings of ICALP 2004. V. Guruswami, D. Micciancio, and O. Regev. The Complexity of the Covering ...
May 24, 2021 · Abstract. We give a linear-time erasure list-decoding algorithm for expander codes. More precisely, let r > 0 be any integer.
Mar 6, 2015 · Abstract. We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery ...
Abstract—We give a linear-time erasure list-decoding algo- rithm for expander codes. More precisely, let r > 0 be any integer.
We give a linear-time erasure list-decoding algorithm for expander codes. More precisely, let $r > 0$ be any integer. Given an inner code $C_0$ of length ...