No label defined (Q5857610)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7330814

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7330814

Statements

scholarly article

0 references

0 references

Govind Ramnarayan

0 references

Ron D. Rothblum

0 references

Theory of Computing

0 references

publication date

1 April 2021

0 references

zbMATH Keywords

codes

0 references

PCPs

0 references

locally correctable codes

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.4086/toc.2020.v016a018

0 references

A linear time erasure-resilient code with nearly optimal recovery

0 references

Proof verification and the hardness of approximation problems

0 references

Probabilistic checking of proofs

0 references

Locally Recoverable Codes on Algebraic Curves

0 references

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

0 references

Sound 3-Query PCPPs Are Long

0 references

Self-testing/correcting with applications to numerical problems

0 references

Bounds on the Size of Locally Recoverable Codes

0 references

An adaptivity hierarchy theorem for property testing

0 references

Composition of Low-Error 2-Query PCPs Using Decodable PCPs

0 references

Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem

0 references

3-Query Locally Decodable Codes of Subexponential Length

0 references

Highly resilient correctors for polynomials

0 references

Bravely, Moderately: A Common Theme in Four Recent Works

0 references

Introduction to Property Testing

0 references

0 references

Strong Locally Testable Codes with Relaxed Local Decoders

0 references

Locally testable codes and PCPs of almost-linear length

0 references

On the Locality of Codeword Symbols

0 references

On the Power of Relaxed Local Decoding Algorithms

0 references

Non-interactive proofs of proximity

0 references

How Long Can Optimal Locally Repairable Codes Be?

0 references

Error Detecting and Error Correcting Codes

0 references

Class of constructive asymptotically good algebraic codes

0 references

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity

0 references

Algebraic methods for interactive proof systems

0 references

Combinatorial Construction of Locally Testable Codes

0 references

Combinatorial PCPs with short proofs

0 references

Two-query PCP with subconstant error

0 references

Undirected connectivity in log-space

0 references

Constant-round interactive proofs for delegating computation

0 references

Entropy waves, the zig-zag graph product, and new constant-degree expanders

0 references

Robust Characterizations of Polynomials with Applications to Program Testing

0 references

Efficient checking of polynomials and proofs and the hardness of approximation problems

0 references

A Family of Optimal Locally Recoverable Codes

0 references

0 references

Towards 3-query locally decodable codes of subexponential length

0 references

Locally Decodable Codes

0 references

Identifiers

zbMATH Open document ID

0 references

10.4086/toc.2020.v016a018

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5857610

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5857610&oldid=36666593"