On Matrix Rigidity and Locally Self-Correctable Codes

doi 10.1109/ccc.2010.35
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

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

2020English

Reliable Computations Based on Locally Decodable Codes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Constructions and Properties of Linear Locally Repairable Codes

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

Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion

SIAM Journal on Mathematics of Data Science
2019English

Sparse Affine-Invariant Linear Codes Are Locally Testable

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2015English

Extending Self-Orthogonal Codes

TURKISH JOURNAL OF MATHEMATICS
2019English

Bordered Constructions of Self-Dual Codes From Group Rings and New Extremal Binary Self-Dual Codes

Finite Fields and Their Applications
Theoretical Computer ScienceApplied MathematicsNumber TheoryEngineeringAlgebra
2019English

Towards 3-Query Locally Decodable Codes of Subexponential Length

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2008English

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy