We will continue to consider the Palm's model of a neural net fragment which is called the associative net. The functional task of the associative net is to store an arbitrary mapping (an arbitrary set of associations) of the t-set of questions (conditioned stimuli) on the t-set of answers (unconditioned stimuli). Questions and answers are represented by binary (0-1) codewords of superimposed and
codes, respectively. We will consider some known constructions of
superimposed and
codes. We give a survey of lower and upper bounds
on the length of those codes. We will also continue to discuss cyclic
processes in the Boolean associative nets.
![[Back]](left_arrow.gif){kind=icon}