Abstract A variation of a serial implementation of an associative memory network is considered. The memory is represented by a matrix-scheme with an extremely clipped Hebb-like synaptic rule. The analysis of the coding parameters shows that the proposed algorithm works faster than conventional approaches, provided that the patterns are extremely sparse. The retrieval time is independent of the number of stored items.