Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Tight lower bounds for linear 2-query LCCs over finite fields
Arnab Bhattacharyya
,
Zeev Dvir
, Shubhangi Saraf
, Amir Shpilka
Computer Science
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
7
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Tight lower bounds for linear 2-query LCCs over finite fields'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Finite Field
100%
Probability Theory
20%
Combinatorics
20%
Error Correcting Codes
20%
Strong Form
20%
Prime Order
20%
Incidence Geometry
20%
Keyphrases
Linearity Assumption
20%