scientific article; zbMATH DE number 2019623

zbMATH Open1028.94512MaRDI QIDQ4440426FDOQ4440426

Kenji Obata

Publication date: 17 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830039.htm

Title of this publication is not available (Why is that?)

Recommendations

• Lower bounds for linear locally decodable codes and private information retrieval
• Automata, Languages and Programming
• Exponential lower bound for 2-query locally decodable codes via a quantum argument
• Exponential lower bound for 2-query locally decodable codes via a quantum argument
• A quadratic lower bound for three-query linear locally decodable codes over any field

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Linear codes (general theory) (94B05) Decoding (94B35)

Cited In (10)

• Towards lower bounds on locally testable codes via density arguments
• A quadratic lower bound for three-query linear locally decodable codes over any field
• High-rate codes with sublinear-time decoding
• Lower bounds for adaptive locally decodable codes
• Composition of Low-Error 2-Query PCPs Using Decodable PCPs
• An optimal lower bound for 2-query locally decodable linear codes
• Query-efficient locally decodable codes of subexponential length
• Exponential lower bound for 2-query locally decodable codes via a quantum argument
• On the Power of Relaxed Local Decoding Algorithms
• General constructions for information-theoretic private information retrieval

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440426)