Corruption and Recovery-Efficient Locally Decodable Codes

DOI10.1007/978-3-540-85363-3_46zbMath1159.68458OpenAlexW144891566MaRDI QIDQ3541822

David P. Woodruff

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_46

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)

Related Items (1)

A quadratic lower bound for three-query linear locally decodable codes over any field

This page was built for publication: Corruption and Recovery-Efficient Locally Decodable Codes