scientific article; zbMATH DE number 1263215

zbMath1058.94525MaRDI QIDQ4234087

Daniel A. Spielman

Publication date: 1995

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (11)

The complexity of error-correcting codes ⋮ A note on the decoding complexity of error-correcting codes ⋮ Garbling XOR gates ``for free in the standard model ⋮ Oblivious transfer with constant computational overhead ⋮ On sparse parity check matrices (extended abstract) ⋮ Revisiting time-space tradeoffs for function inversion ⋮ Construction of expanders and superconcentrators using Kolmogorov complexity ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Highly symmetric expanders ⋮ Reliable communication over highly connected noisy networks ⋮ Fast Interactive Coding against Adversarial Noise

This page was built for publication: