Principal interconnections in higher order Hebbian-type associative memories

Abstract

The existence of principal interconnections useful in solving the proliferation problem in higher order Hebbian-type associative memories is introduced. Among all legal interconnections, we prove there exists a subset T-pr that carries more information than the others. Regardless of the network order p, the elements in T-pr are shown to be those interconnections T that fall within the range of