Sparse Affine-Invariant Linear Codes Are Locally Testable

Computational Complexity - Switzerland
doi 10.1007/s00037-015-0115-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Constructions and Properties of Linear Locally Repairable Codes

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

Affine Invariant Texture Signatures

English

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2006English

Generalized Affine Invariant Image Normalization

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
1997English

Invariant Subspaces for Algebras of Linear Operators and Amenable Locally Compact Groups

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Codes and Invariant Theory

Mathematische Nachrichten
Mathematics
2004English

Affine Invariant Subspaces of C( C )

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1989English

Supervised Translation-Invariant Sparse Coding

2010English

On Conformal Anti-Invariant Submersions Whose Total Manifolds Are Locally Product Riemannian

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy