An optimal lower bound for 2-query locally decodable linear codes
type: Item
instance of: scholarly article
title: An optimal lower bound for 2-query locally decodable linear codes
zbMATH Open document ID: 1184.68245
author: Dungjade Shiowattana
author: Satyanarayana V. Lokam
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94B35
zbMATH DE Number: 5650205
zbMATH Keywords: combinatorial problems
zbMATH Keywords: computational complexity
zbMATH Keywords: cryptography
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.11.009
OpenAlex ID: W2078058008
cites work: Upper bound on the communication complexity of private information retrieval
cites work: Q4535072
cites work: Lower bounds for adaptive locally decodable codes
cites work: On the efficiency of local decoding procedures for error-correcting codes
cites work: Extractors
cites work: Q4440426
cites work: Expander codes
cites work: Automata, Languages and Programming
DOI: 10.1016/J.IPL.2005.11.009
description: scientific article; zbMATH DE number 5650205