Pages that link to "Item:Q3546358"

The following pages link to Towards 3-query locally decodable codes of subexponential length (Q3546358):

Displaying 38 items.

• Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
• A novel elementary construction of matching vectors (Q436582) (← links)
• On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
• On matrix rigidity and locally self-correctable codes (Q645122) (← links)
• Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
• Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
• Private information retrieval with sublinear online time (Q2055601) (← links)
• Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
• A general private information retrieval scheme for MDS coded databases with colluding servers (Q2329401) (← links)
• Local correctability of expander codes (Q2347805) (← links)
• A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
• Robust characterizations of \(k\)-wise independence over product spaces and related testing results (Q2856576) (← links)
• Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length (Q2947559) (← links)
• Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
• Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
• Three query locally decodable codes with higher correctness require exponential length (Q3113729) (← links)
• High-entropy dual functions over finite fields and locally decodable codes (Q4965879) (← links)
• On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
• Relaxed Locally Correctable Codes (Q4993290) (← links)
• Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
• (Q5090982) (← links)
• Multiple correlation sequences not approximable by nilsequences (Q5095126) (← links)
• Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
• A combination of testability and decodability by tensor products (Q5252263) (← links)
• Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits (Q5422493) (← links)
• High-rate codes with sublinear-time decoding (Q5501932) (← links)
• (Q5857610) (← links)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
• Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (Q5885585) (← links)
• Locally Decodable Codes (Q5892557) (← links)
• Erasures versus errors in local decoding and property testing (Q6074671) (← links)
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
• A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)
• On the optimal communication complexity of error-correcting multi-server PIR (Q6169550) (← links)
• Private information retrieval with result verification for more servers (Q6535117) (← links)
• Near-optimal private information retrieval with preprocessing (Q6582182) (← links)