Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
From MaRDI portal
Publication:4973884
DOI10.1145/3016802zbMath1427.94088OpenAlexW2286352523MaRDI QIDQ4973884
Arnab Bhattacharyya, Sivakanth Gopi
Publication date: 6 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5840/
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 (1)
This page was built for publication: Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs