Exact data retrieval of associative memory with further reduced cross talk

The recalling performance of associative memory based on the outer product algorithm can be explicitly formalized as a functional form of Hamming distance between the memorized keys and the input key. This functional form is quite similar to the Krawtchouk polynomial, and thus cross talk in associative memory can be efficiently reduced by utilizing the functional properties of the Krawtchouk polynomial. In this paper, it is shown that, by further employment of encoding techniques, advanced effective cross talk reduction can be achieved and thus superior exact data retrieval is substantiated by computer experiments.<>