
The paper establishes tight lower bounds on the block length of binary 3-query locally correctable codes (3-LCCs). It proves a sharp lower bound for design 3-LCCs that matches the best known construction up to a constant factor. It also obtains superpolynomial lower bounds for smooth 3-LCCs with high completeness.


coremsg

tight-lower-bounds-for-binary-3-query-locally-correctable-codes-and-designs


Tight Lower Bounds for Binary 3-Query Locally Correctable Codes and Designs
