Capacity of bidirectional associative memory

Abstract

The capacity of Bidirectional associative memory (BAM) was examined a lot in research, but not completely. In particular, this issue was not investigated in the context of strings coding. In this paper we apply different approaches to estimate the capacity of BAM for strings coding. One of these approaches is recalling of all coded strings. Another is applying Hamming and Levenshtein distances to recover coded strings. The experiments show poor performance of BAM for the problem of strings coding. In addition, we find a small example of poor performance of BAM. We also discover that there is its extended version. The examples can be used to test advanced methods of coding of strings.