Lower bounds on the capacities of binary and ternary networks storing sparse random vectors
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 38 (6) , 1633-1647
- https://doi.org/10.1109/18.165439
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the capacity of ternary Hebbian networksIEEE Transactions on Information Theory, 1991
- On the capacity of associative memories with linear threshold functionsIEEE Transactions on Information Theory, 1989
- Neural networks that use three-state neuronsJournal of Physics A: General Physics, 1989
- Information processing in three-state neural networksJournal of Statistical Physics, 1989
- Optimal pruning with applications to tree-structured source coding and modelingIEEE Transactions on Information Theory, 1989
- Characteristics of sparsely encoded associative memoryNeural Networks, 1989
- Information capacity of associative memoriesIEEE Transactions on Information Theory, 1989
- Dynamics and statistical mechanics of the Hopfield modelJournal of Physics A: General Physics, 1987
- The capacity of the Hopfield associative memoryIEEE Transactions on Information Theory, 1987
- Sums of Independent Random VariablesPublished by Springer Nature ,1975