Relaxed Locally Correctable Codes With Nearly-Linear Block Length and Constant Query Complexity

doi 10.1137/1.9781611975994.84
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Three-Query Locally Decodable Codes With Higher Correctness Require Exponential Length

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2012English

Towards 3-Query Locally Decodable Codes of Subexponential Length

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2008English

On Matrix Rigidity and Locally Self-Correctable Codes

2010English

Constant Rate PCPs for Circuit-Sat With Sublinear Query Complexity

2013English

Constructions and Properties of Linear Locally Repairable Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2016English

Constant Length Substitutions, Iterated Function Systems and Amorphic Complexity

Mathematische Zeitschrift
Mathematics
2019English

Sparse Affine-Invariant Linear Codes Are Locally Testable

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2015English

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2006English

Set Reconciliation With Nearly Optimal Communication Complexity

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy