Exponential pattern retrieval capacity with non-binary associative memory

@article{Kumar2011ExponentialPR,
  title={Exponential pattern retrieval capacity with non-binary associative memory},
  author={K. Raj Kumar and Amir Hesam Salavati and Amir H. Shokrollahi},
  journal={2011 IEEE Information Theory Workshop},
  year={2011},
  pages={80-84}
}
We consider the problem of neural association for a network of non-binary neurons. Here, the task is to recall a previously memorized pattern from its noisy version using a network of neurons whose states assume values from a finite number of non-negative integer levels. Prior works in this area consider storing a finite number of purely random patterns, and have shown that the pattern retrieval capacities (maximum number of patterns that can be memorized) scale only linearly with the number of… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Introduction to the theory of neural computation

The advanced book program • 1991
View 4 Excerpts
Highly Influenced

V

C. Berrou
Gripon,Coded Hopfield Networks , Proc. Symp. on Turbo Codes and Iterative Information Processing, pp. 15 • 2010
View 2 Excerpts

Abbott,Theoretical neuroscience: computational and mathematical modeling of neural systems

L.F.P. Dayan
2004
View 1 Excerpt

Improvements of complex-valued Hopfield associative memory by using generalized projection rules

D. L. Lee
IEEE Tran. Neur. Net.,Vol. 12, No. 2 • 2001
View 1 Excerpt

Miller,Expander graph arguments for message passing algorithms

G. D. Burshtein
IEEE Trans. Inform. Theory, • 2001
View 2 Excerpts

A Course in Computational Algebraic Number Theory

H. Cohen
Springer • 2000
View 1 Excerpt

Similar Papers

Loading similar papers…