XOR Codes and Sparse Learning Parity with Noise

DOI10.1137/1.9781611975482.61zbMath1433.68265OpenAlexW4244320771MaRDI QIDQ5236245

No author found.

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.61

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Oblivious transfer with constant computational overhead ⋮ BKW meets Fourier new algorithms for LPN with sparse parities

This page was built for publication: XOR Codes and Sparse Learning Parity with Noise