Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (2022)

First Author: Chiesa A
Attributed to:  Foundations of classical and quantum verifiable computing funded by FLF

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/20m135515x

Publication URI: http://dx.doi.org/10.1137/20m135515x

Type: Journal Article/Review

Parent Publication: SIAM Journal on Computing

Issue: 6