K. Zheng

activity

20232026

most citedImproved Round-by-round Soundness IOPs via Reed-Muller Codes

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing cs.CCShow all

5 papers · 1 filter

cs.CC2025

3-Query RLDCs are Strictly Stronger than 3-Query LDCs

Tom Gur, Dor Minzer, Guy Weissenberg +1

We construct $3$ -query relaxed locally decodable codes (RLDCs) with constant alphabet size and length $O ~ (k^{2})$ for $k$ -bit messages. Combined with the lower bound of $\tild…

cs.CC2025

Near Optimal Hardness of Approximating $k$ -CSP

Dor Minzer, Kai Zhe Zheng

We show that for every $k \in N$ and $ε > 0$ , for large enough alphabet $R$ , given a $k$ -CSP with alphabet size $R$ , it is NP-hard to distinguish between the case th…

cs.CC2025★ 1 cited

Improved Round-by-round Soundness IOPs via Reed-Muller Codes

Dor Minzer, Kai Zhe Zheng

We give an IOPP (interactive oracle proof of proximity) for trivariate Reed-Muller codes that achieves the best known query complexity in some range of security parameters. Specifi…

cs.CC2024

Near Optimal Alphabet-Soundness Tradeoff PCPs

Dor Minzer, Kai Zhe Zheng

We show that for all $ε > 0$ , for sufficiently large $q \in N$ power of $2$ , for all $δ > 0$ , it is NP-hard to distinguish whether a given $2$ -Prover- $1$ -Round project…

cs.CC2023

Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries

Dor Minzer, Kai Zheng

A local tester for an error correcting code $C \subseteq Σ^{n}$ is a tester that makes $Q$ oracle queries to a given word $w \in Σ^{n}$ and decides to accept or reject the word $w$ . An…

3-Query RLDCs are Strictly Stronger than 3-Query LDCs

Near Optimal Hardness of Approximating k-CSP

Improved Round-by-round Soundness IOPs via Reed-Muller Codes

Near Optimal Alphabet-Soundness Tradeoff PCPs

Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries

Near Optimal Hardness of Approximating $k$ -CSP