ECCC 2010 - PDF Preprint Papers

ECCC 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ECCC-2010 Paper

click to vote

ECCC
2010

153views more ECCC 2010»

Local list decoding with a constant number of queries

12 years 11 months ago

Download www.cs.tau.ac.il

Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...

Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	153	Local list decoding with a constant number of queries	claim
2	147	A Note on Amplifying the Error-Tolerance of Locally Decodable Codes	claim
3	143	Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs	claim
4	140	Query-Efficient Locally Decodable Codes	claim
5	131	High-rate codes with sublinear-time decoding	claim
6	124	Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas	claim
7	124	A counterexample to the Alon-Saks-Seymour conjecture and related problems	claim
8	122	Query Complexity Lower Bounds for Reconstruction of Codes	claim
9	119	On beating the hybrid argument	claim
10	117	Nearly Tight Bounds for Testing Function Isomorphism	claim
11	111	Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}	claim
12	111	Pseudorandom Generators for Group Products	claim
13	108	Improved bounds for the randomized decision tree complexity of recursive majority	claim
14	107	{Algorithmic Minimal Sufficient Statistics: a New Definition	claim
15	107	Bypassing UGC from some optimal geometric inapproximability results	claim
16	107	On the Sum of Square Roots of Polynomials and related problems	claim
17	106	Hardness of Parameterized Resolution	claim
18	104	A Counterexample to the Generalized Linial-Nisan Conjecture	claim
19	104	Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields	claim
20	103	Time-Space Efficient Simulations of Quantum Computations	claim
21	103	Pseudorandom Generators for Regular Branching Programs	claim
22	103	A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games	claim
23	99	A Unified Framework for Testing Linear-Invariant Properties	claim
24	98	A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem	claim
25	98	Verifying Computations with Streaming Interactive Proofs	claim
26	98	Efficient Semantic Communication via Compatible Beliefs	claim
27	95	Bounded-depth circuits cannot sample good codes	claim
28	95	On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography	claim
29	94	Derandomized Parallel Repetition via Structured PCPs	claim
30	93	Towards Coding for Maximum Errors in Interactive Communication	claim
31	92	Logspace Versions of the Theorems of Bodlaender and Courcelle	claim
32	91	Limits on the rate of locally testable affine-invariant codes	claim
33	91	Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods	claim
34	90	A note on circuit lower bounds from derandomization	claim
35	90	Optimal bounds for sign-representing the intersection of two halfspaces by polynomials	claim
36	89	Lower bounds for designs in symmetric spaces	claim
37	89	Read-Once Polynomial Identity Testing	claim
38	89	Estimating the unseen: A sublinear-sample canonical estimator of distributions	claim
39	88	On the Minimal Fourier Degree of Symmetric Boolean Functions	claim
40	87	On the degree of symmetric functions on the Boolean cube	claim
41	87	Testing monotonicity of distributions over general partial orders	claim
42	86	On Approximating the Entropy of Polynomial Mappings	claim
43	83	Deterministic Identity Testing of Read-Once Algebraic Branching Programs	claim
44	83	Symmetric LDPC codes are not necessarily locally testable	claim
45	82	A Strong Parallel Repetition Theorem for Projection Games on Expanders	claim
46	82	Pseudorandom Generators for Combinatorial Checkerboards	claim
47	82	On optimal proof systems and logics for PTIME	claim
48	80	Query Complexity in Errorless Hardness Amplification	claim
49	80	Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds	claim
50	80	Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm	claim
51	79	IP = PSPACE using Error Correcting Codes	claim
52	79	Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae	claim
53	78	PCPs and the Hardness of Generating Synthetic Data	claim
54	77	In a World of P=BPP	claim
55	77	Efficient Communication Using Partial Information	claim
56	76	Introduction to Testing Graph Properties	claim
57	75	Testing Properties of Collections of Distributions	claim
58	74	Testing linear-invariant non-linear properties: A short report	claim
59	73	Matching Vector Codes	claim
60	72	Paris-Harrington tautologies	claim
61	64	Weak Kernels	claim
62	58	Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition	claim
63	56	Nisan-Wigderson generators in proof systems with forms of interpolation	claim
64	55	Invariance in Property Testing	claim
65	47	Randomness buys depth for approximate counting	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers