scientific article; zbMATH DE number 7376033

DOI10.4230/LIPIcs.ICALP.2018.106zbMath1499.68099MaRDI QIDQ5002790

Elena Grigorescu, Jeremiah Blocki, Venkata Gandikota, Samson Zhou

Publication date: 28 July 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computationally bounded channelslocal expandersrelaxed locally correctable codes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• On sparse graphs with dense long paths
• Sustained space complexity
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Public Key Locally Decodable Codes with Short Keys
• On the efficiency of local decoding procedures for error-correcting codes
• Public-Key Locally-Decodable Codes
• Relaxed Locally Correctable Codes
• Depth-Robust Graphs and Their Cumulative Memory Complexity
• Private Locally Decodable Codes
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• Unnamed Item
• Unnamed Item

This page was built for publication: