Transparent error correcting in a computationally bounded world

DOI10.1007/978-3-030-64381-2_19zbMath1495.94151OpenAlexW3116897941MaRDI QIDQ2119094

Justin Holmgren, Ofer Grossman, Eylon Yogev

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64381-2_19

zbMATH Keywords

uniquely decodable codes against channels

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (2)

Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ Correlation intractability and SNARGs from sub-exponential DDH

This page was built for publication: Transparent error correcting in a computationally bounded world