There is a rich interplay between coding theory and computational complexity theory that has enriched both disciplines over the years. In particular, list ...
There is a rich interplay between coding theory and computational complexity theory that has enriched both disciplines over the years. In particular, list ...
The aim here is to present list decoding and closely related notions, which have been instrumental in several advances in explicit constructions of ...
The primary focus of this thesis concerns the construction of list-decodable codes. Specifically, we consider various random ensembles of codes, and show that ...
The investigator has identified the shortcomings in theory and aims to pave the way toward optimal constructions of error-correcting codes and related ...
List decoding and pseudorandom constructions: lossless expanders and extractors from Parvaresh-Vardy codes. Venkatesan Guruswami. Carnegie Mellon University.
Abstract—This is a brief survey into the applications of list decoding in complexity theory, specifically in relating the worst- case and average-case ...
Mar 30, 2023 · These codes can be sampled with randomness linear in the block-length, and achieve list-decoding capacity (among other local properties). Our ...
For such large q there are explicit constructions of list decodable codes of rate. R that achieve: R = 1 − p − ϵ ⇐⇒ p = 1 − R − ϵ with polynomial time ...
Missing: Pseudorandom | Show results with:Pseudorandom
In this section, we show how averaging samplers and expander graphs can be understood as variants of list-decodable codes. The general list decoding framework ...