Automata, Languages and Programming
From MaRDI portal
Publication:5716765
DOI10.1007/11523468zbMath1081.68028OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716765
Stephanie Wehner, Ronald de Wolf
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Quantum computation (81P68) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62)
Related Items
Single-server private information retrieval with sublinear amortized time, On locally decodable codes, self-correctable codes, and \(t\)-private PIR, Lower bounds for (batch) PIR with private preprocessing, On the optimal communication complexity of error-correcting multi-server PIR, Query-efficient locally decodable codes of subexponential length, General constructions for information-theoretic private information retrieval, 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, Some Open Problems in Information-Theoretic Cryptography