The following pages link to Noga Ron-Zewi (Q2012175):
Displaying 25 items.
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- On Public Key Encryption from Noisy Codewords (Q2798809) (← links)
- Absolutely Sound Testing of Lifted Codes (Q2851893) (← links)
- (Q2941633) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes (Q3167433) (← links)
- (Q3191595) (← links)
- From Affine to Two-Source Extractors via Approximate Duality (Q3451757) (← links)
- Towards Optimal Deterministic Coding for Interactive Communication (Q4575719) (← links)
- High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (Q4640284) (← links)
- Explicit Capacity Approaching Coding for Interactive Communication (Q4682935) (← links)
- Linear-Time Erasure List-Decoding of Expander Codes (Q4958269) (← links)
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity (Q5020732) (← links)
- Efficient List-Decoding With Constant Alphabet and List Sizes (Q5080020) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- (Q5090443) (← links)
- (Q5093398) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- On List Recovery of High-Rate Tensor Codes (Q5151710) (← links)
- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications (Q5167806) (← links)
- An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
- (Q5875528) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
- Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes (Q6513980) (← links)
