scientific article; zbMATH DE number 2019623
From MaRDI portal
Publication:4440426
zbMath1028.94512MaRDI QIDQ4440426
Publication date: 17 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830039.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear codes (general theory) (94B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decoding (94B35)
Related Items (9)
A quadratic lower bound for three-query linear locally decodable codes over any field ⋮ Query-efficient locally decodable codes of subexponential length ⋮ Lower bounds for adaptive locally decodable codes ⋮ Towards lower bounds on locally testable codes via density arguments ⋮ General constructions for information-theoretic private information retrieval ⋮ Exponential lower bound for 2-query locally decodable codes via a quantum argument ⋮ On the Power of Relaxed Local Decoding Algorithms ⋮ High-rate codes with sublinear-time decoding ⋮ An optimal lower bound for 2-query locally decodable linear codes
This page was built for publication:
