Coded Hopfield networks

@article{Berrou2010CodedHN,
  title={Coded Hopfield networks},
  author={C. Berrou and V. Gripon},
  journal={2010 6th International Symposium on Turbo Codes & Iterative Information Processing},
  year={2010},
  pages={1-5}
}
  • C. Berrou, V. Gripon
  • Published 2010
  • Computer Science
  • 2010 6th International Symposium on Turbo Codes & Iterative Information Processing
  • Error-correcting coding is introduced in associative memories based on Hopfield networks in order to increase the learning diversity as well as the recall robustness in presence of erasures and errors. To achieve this, the graph associated with the classical Hopfield network is transformed into a bipartite graph in which incoming information is linked to orthogonal or quasi-orthogonal codes. Whereas learning is similar to that of classical (i.e. Hebbian) Hopfield networks, memory retrieval… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Clique-Based Neural Associative Memories with Local Coding and Precoding
    2
    A simple and efficient way to store many messages using neural cliques
    31
    A Massively Parallel Associative Memory Based on Sparse Neural Networks
    11
    Coding Theory and Neural Associative Memories with Exponential Pattern Retrieval Capacity
    3
    Sparse Neural Networks With Large Learning Diversity
    137

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES
    The capacity of the Hopfield associative memory
    593
    Hopfield networks
    23
    Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm
    964
    “Neural” computation of decisions in optimization problems
    3863
    Good Codes Based on Very Sparse Matrices
    468
    Hopfield network. Scholarpedia
    • 2007
    Low Density Parity Check Codes
    4211
    Near Shannon limit error-correcting and decoding: Turbo codes
    2856