Neural networks, error-correcting codes, and polynomials over the binary n-cube
From MaRDI portal
Publication:4733833
DOI10.1109/18.42215zbMath0683.94017MaRDI QIDQ4733833
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/
neural networks; decoding; energy function; error-correcting codes; n-cube; maximization of polynomials
94C05: Analytic circuit theory
94B99: Theory of error-correcting codes and error-detecting codes
94B35: Decoding
Related Items
Synthesis of adaptive logical networks on the basis of Zhegalkin polynomials, Approximation algorithms for discrete polynomial optimization, Handelman's hierarchy for the maximum stable set problem, Are analog neural networks better than binary neural networks?, Synthesis of neural-like networks on the basis of conversion of cyclic Hamming codes, Continuous dynamical systems that realize discrete optimization on the hypercube