Lower bounds for constant query affine-invariant LCCs and LTCs

DOI10.4230/LIPIcs.CCC.2016.12zbMath1380.94143arXiv1511.07558OpenAlexW2736282744MaRDI QIDQ5368746

Sivakanth Gopi, Arnab Bhattacharyya

Publication date: 10 October 2017

Full work available at URL: https://arxiv.org/abs/1511.07558

zbMATH Keywords

affine invariancelocally correctable codeGowers uniformity normlocally testable code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Locality via Partially Lifted Codes ⋮ Unnamed Item

This page was built for publication: Lower bounds for constant query affine-invariant LCCs and LTCs