In this paper, we prove a lower bound on the soundness of quantum locall...
1 - (1-x^M) ^ 2^M > (1 - (1-x)^M) ^2^M is proved for all x ∈ [0,1]
and a...
Polarization is an unprecedented coding technique in that it not only
ac...
Polar code visibly approaches channel capacity in practice and is thereb...
We construct an explicit family of 3-XOR instances hard for
Ω(n)-levels ...
A locally testable code (LTC) is an error correcting code with a propert...