  We study the ability of linear recurrent networks obeying discrete time
dynamics to store long temporal sequences that are retrievable from the
instantaneous state of the network. We calculate this temporal memory capacity
for both distributed shift register and random orthogonal connectivity
matrices. We show that the memory capacity of these networks scales with system
size.
