On the Hardness of Decoding the Gale–Berlekamp Code

DOI10.1109/TIT.2007.915716zbMath1311.94121MaRDI QIDQ3604688

Krishnamurthy Viswanathan, Ron M. Roth

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decoding (94B35)

Related Items (6)

Speeding up Graph Algorithms via Switching Classes ⋮ Unnamed Item ⋮ Patience of matrix games ⋮ A Gale-Berlekamp permutation-switching problem ⋮ First order deformations of the Fourier matrix ⋮ Some applications of hypercontractive inequalities in quantum information theory

This page was built for publication: On the Hardness of Decoding the Gale–Berlekamp Code