◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Geoffrey Mon

1 paper hereh-index 4131 citations9 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1

identity via Semantic Scholar / OpenAlex

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2025

Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes

Elena Grigorescu, Vinayak M. Kumar, Peter Manohar +1

A locally decodable code (LDC) C:{0,1}k→{0,1}n is an error-correcting code that allows one to recover any bit of the original message with good probability while…

cs.CC2024

Relaxed Local Correctability from Local Testing

Vinayak M. Kumar, Geoffrey Mon

We construct the first asymptotically good relaxed locally correctable codes with polylogarithmic query complexity, bringing the upper bound polynomially close to the lower bound o…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.