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

DOI10.1109/18.42215zbMATH Open0683.94017OpenAlexW2131194367MaRDI QIDQ4733833FDOQ4733833

Authors: Jehoshua Bruck, Mario Blaum 

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/

Recommendations

• scientific article; zbMATH DE number 2217266
• Are analog neural networks better than binary neural networks?
• scientific article; zbMATH DE number 57441
• An application of the Hopfield model to Huffman codes
• scientific article; zbMATH DE number 853066

zbMATH Keywords

neural networkserror-correcting codesdecodingenergy functionn-cubemaximization of polynomials

Mathematics Subject Classification ID

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

Cited In (13)

• Error-correcting codes and neural networks
• Handelman's hierarchy for the maximum stable set problem
• Synthesis of adaptive logical networks on the basis of Zhegalkin polynomials
• Title not available (Why is that?)
• Are analog neural networks better than binary neural networks?
• Diophantine neural networks over a finite field: Methods of synthesis and minimization of their complexity
• A unified method to construct neural network decoders for arbitrary codes and decoding rules
• Syndrome decoding by quantum approximate optimization
• Continuous dynamical systems that realize discrete optimization on the hypercube
• Neural net decoders for linear block codes
• Title not available (Why is that?)
• Synthesis of neural-like networks on the basis of conversion of cyclic Hamming codes
• Approximation algorithms for discrete polynomial optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733833)