Neural networks, error-correcting codes, and polynomials over the binary n-cube

DOI10.1109/18.42215zbMath0683.94017OpenAlexW2131194367MaRDI QIDQ4733833

Mario Blaum, Jehoshua Bruck

Publication date: 1989

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

Full work available at URL: https://authors.library.caltech.edu/5701/

zbMATH Keywords

neural networksdecodingenergy functionerror-correcting codesn-cubemaximization of polynomials

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Theory of error-correcting codes and error-detecting codes (94B99) Decoding (94B35)

Related Items (6)

Synthesis of adaptive logical networks on the basis of Zhegalkin polynomials ⋮ Are analog neural networks better than binary neural networks? ⋮ Approximation algorithms for discrete polynomial optimization ⋮ Synthesis of neural-like networks on the basis of conversion of cyclic Hamming codes ⋮ Handelman's hierarchy for the maximum stable set problem ⋮ Continuous dynamical systems that realize discrete optimization on the hypercube

This page was built for publication: Neural networks, error-correcting codes, and polynomials over the binary n-cube