The following pages link to Tali Kaufman (Q295847):
Displaying 50 items.
- Isoperimetric inequalities for Ramanujan complexes and topological expanders (Q295848) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- On expansion and topological overlap (Q1663786) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- High order random walks: beyond spectral gap (Q2003767) (← links)
- Erratum to: ``High order random walks: beyond spectral gap'' (Q2064755) (← links)
- High dimensional expanders and property testing (Q2988903) (← links)
- Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2) (Q3053157) (← links)
- Dense Locally Testable Codes Cannot Have Constant Rate and Distance (Q3088121) (← links)
- On Expansion and Topological Overlap (Q3132869) (← links)
- Testing Polynomials over General Fields (Q3446819) (← links)
- Breaking the ε-Soundness Bound of the Linearity Test over GF(2) (Q3541815) (← links)
- Testing Reed–Muller Codes (Q3546491) (← links)
- A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes (Q3547113) (← links)
- Verifying and decoding in constant depth (Q3549643) (← links)
- (Q3549649) (← links)
- (Q3549694) (← links)
- Algebraic property testing: the role of invariance (Q3549724) (← links)
- (Q3579435) (← links)
- Testing triangle-freeness in general graphs (Q3581490) (← links)
- Locally Testable vs. Locally Decodable Codes (Q3588443) (← links)
- Testing Triangle-Freeness in General Graphs (Q3629476) (← links)
- Succinct Representation of Codes with Applications to Testing (Q3638901) (← links)
- High Dimensional Random Walks and Colorful Expansion (Q4638053) (← links)
- Tight Bounds for Testing Bipartiteness in General Graphs (Q4651520) (← links)
- Guessing secrets efficiently via list decoding (Q4828940) (← links)
- Succinct Representation of Codes with Applications to Testing (Q4915191) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- Guessing secrets efficiently via list decoding (Q4962681) (← links)
- (Q5009543) (← links)
- Free Flags Over Local Rings and Powering of High-dimensional Expanders (Q5043810) (← links)
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders (Q5087011) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- (Q5093398) (← links)
- Construction of new local spectral high dimensional expanders (Q5230337) (← links)
- List Decoding with Double Samplers (Q5236316) (← links)
- Weight Distribution and List-Decoding Size of Reed–Muller Codes (Q5271939) (← links)
- Explicit Low-Weight Bases for BCH Codes (Q5272149) (← links)
- Bounded degree cosystolic expanders of every dimension (Q5361817) (← links)
- Locally Testable Codes Require Redundant Testers (Q5390594) (← links)
- Edge transitive ramanujan graphs and symmetric LDPC good codes (Q5415487) (← links)
- New Extension of the Weil Bound for Character Sums with Applications to Coding (Q5495042) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- Testing Odd Direct Sums Using High Dimensional Expanders (Q5875508) (← links)
- (Q5875781) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894226) (← links)
- Proximity Oblivious Testing and the Role of Invariances (Q5894230) (← links)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Q5898601) (← links)
