Advanced search
Publication Cover
Network: Computation in Neural Systems Volume 3, 1992 - Issue 2
Submit an article Journal homepage
62
Views
34
CrossRef citations to date
0
Altmetric
Original Article

Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states

G Palm C u O Vogt Institut für Hirnforschung, Universitätsstrasse 1, D-4000, Düsseldorf, Federal Republic of Germany
&
F T Sommer C u O Vogt Institut für Hirnforschung, Universitätsstrasse 1, D-4000, Düsseldorf, Federal Republic of Germany
Pages 177-186 | Received 28 Mar 1991, Published online: 09 Jul 2009

Citations (34)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (7)

Cristina Meli & Anders Lansner. (2013) A modular attractor associative memory with patchy connectivity and weight pruning. Network: Computation in Neural Systems 24:4, pages 129-150.
Read now
Christian Leibold. (2011) What Autoassociative Network Models May Tell us about the Neurobiology of Memory. Network: Computation in Neural Systems 22:1-4, pages 231-250.
Read now
Rafal Bogacz & Malcolm W Brown. (2002) The restricted influence of sparseness of coding on the capacity of familiarity discrimination networks. Network: Computation in Neural Systems 13:4, pages 457-485.
Read now
Hajime Hirase & Michael Recce. (1996) A search for the optimal thresholding sequence in an associative memory. Network: Computation in Neural Systems 7:4, pages 741-756.
Read now
Toshiaki Tanaka. (1996) Bit error probability of an associative memory with many-to-many correspondence. Network: Computation in Neural Systems 7:3, pages 573-586.
Read now
A Frolov, A Kartashov, A Goltsev & R Folk. (1995) Quality and efficiency of retrieval for Willshaw-like autoassociative networks. II. Recognition. Network: Computation in Neural Systems 6:4, pages 535-549.
Read now
A Frolov, A Kartashov, A Goltsev & R Folk. (1995) Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction. Network: Computation in Neural Systems 6:4, pages 513-534.
Read now

Articles from other publishers (27)

Günther PalmGünther Palm. 2022. Novelty, Information and Surprise. Novelty, Information and Surprise 181 209 .
Günther PalmGünther Palm. 2022. Neural Assemblies. Neural Assemblies 145 174 .
Günther PalmGünther Palm. 2022. Neural Assemblies. Neural Assemblies 111 144 .
Günther PalmGünther Palm. 2022. Neural Assemblies. Neural Assemblies 49 72 .
Andreas Knoblauch & Günther Palm. (2020) Iterative Retrieval and Block Coding in Autoassociative and Heteroassociative Memory. Neural Computation 32:1, pages 205-260.
Crossref
E. Paxon Frady & Friedrich T. Sommer. (2019) Robust computation with rhythmic spike patterns. Proceedings of the National Academy of Sciences 116:36, pages 18050-18059.
Crossref
Xundong E. Wu, Gabriel C. Mel, D. J. Strouse & Bartlett W. Mel. (2019) How Dendrites Affect Online Recognition Memory. PLOS Computational Biology 15:5, pages e1006892.
Crossref
Andreas Knoblauch & Günther Palm. 2019. Artificial Neural Networks and Machine Learning – ICANN 2019: Theoretical Neural Computation. Artificial Neural Networks and Machine Learning – ICANN 2019: Theoretical Neural Computation 3 19 .
Tetyana Baydyk, Ernst Kussul & Donald C. Wunsch IITetyana Baydyk, Ernst Kussul & Donald C. Wunsch II. 2019. Intelligent Automation in Renewable Energy. Intelligent Automation in Renewable Energy 161 226 .
M. Kähne, I. M. Sokolov & S. Rüdiger. (2017) Population equations for degree-heterogenous neural networks. Physical Review E 96:5.
Crossref
E. Lotfi, O. Khazaei & F. Khazaei. (2017) Competitive Brain Emotional Learning. Neural Processing Letters.
Crossref
Andreas Knoblauch & Friedrich T. Sommer. (2016) Structural Plasticity, Effectual Connectivity, and Memory in Cortex. Frontiers in Neuroanatomy 10.
Crossref
E. Lotfi & M.-R. Akbarzadeh-T.. (2016) A winner-take-all approach to emotional neural networks with universal approximation property. Information Sciences 346-347, pages 369-388.
Crossref
Sen Cheng & Markus Werning. (2013) Composition and replay of mnemonic sequences: The contributions of REM and slow-wave sleep to episodic memory. Behavioral and Brain Sciences 36:6, pages 610-611.
Crossref
Günther PalmGünther Palm. 2012. Novelty, Information and Surprise. Novelty, Information and Surprise 161 188 .
Andreas Knoblauch. (2011) Neural Associative Memory with Optimal Bayesian Learning. Neural Computation 23:6, pages 1393-1451.
Crossref
Andreas Knoblauch, Günther Palm & Friedrich T. Sommer. (2010) Memory Capacities for Synaptic and Structural Plasticity. Neural Computation 22:2, pages 289-341.
Crossref
T. Baidyk & E. Kussul. (2010) Ensemble neural networks. Optical Memory and Neural Networks 18:4, pages 295-303.
Crossref
Thomas Wennekers & Günther Palm. (2009) Syntactic sequencing in Hebbian cell assemblies. Cognitive Neurodynamics 3:4, pages 429-441.
Crossref
B. V. Kryzhanovskii, M. V. Kryzhanovskii & B. M. Magomedov. (2007) New accelerated algorithm based on domain neural network for solving optimization tasks. Optical Memory and Neural Networks 16:1, pages 31-39.
Crossref
Martin Rehn & Friedrich T. Sommer. (2006) A network that uses few active neurones to code visual input predicts the diverse shapes of cortical receptive fields. Journal of Computational Neuroscience 22:2, pages 135-146.
Crossref
Rafal Bogacz & Malcolm Brown. (2002) The restricted influence of sparseness of coding on the capacity of familiarity discrimination networks. Network: Computation in Neural Systems 13:4, pages 457-485.
Crossref
F.T. Sommer & P. Dayan. (1998) Bayesian retrieval in associative memories with storage errors. IEEE Transactions on Neural Networks 9:4, pages 705-713.
Crossref
Hajime Hirase & Michael Recce. (1996) A search for the optimal thresholding sequence in an associative memory. Network: Computation in Neural Systems 7:4, pages 741-756.
Crossref
Toshiaki Tanaka. (1996) Bit error probability of an associative memory with many-to-many correspondence. Network: Computation in Neural Systems 7:3, pages 573-586.
Crossref
A Frolov, A Kartashov, A Goltsev & R Folk. (1995) Quality and efficiency of retrieval for Willshaw-like autoassociative networks. II. Recognition. Network: Computation in Neural Systems 6:4, pages 535-549.
Crossref
A Frolov, A Kartashov, A Goltsev & R Folk. (1995) Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction. Network: Computation in Neural Systems 6:4, pages 513-534.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.