In this paper, we present a new model of discrete neural associative memories and its design rule. The most important feature of this new model is that a static mapping instead of the dynamic convergent process is used to retrieve the stored messages. The new model features a two-layer structure, with feedforward connections only and uses two kinds of neurons which implement different output functions. Another important feature is that this new model employs an extremely simple weight setup rule and all the resulted weights can only assume two different values, -1 and +1, which facilitates the VLSI implementation. Compared to the famous discrete Hopfield model designed with the well-known Hebbian rule or any other rule, the new model can guarantee all the given patterns to be stored as fixed points. Moreover, each fixed point is surrounded by an attraction basin (which is a ball in the Hamming distance sense) with the maximal possible radius. The performances of the new model are compared through some illustrative examples with those of the Hopfield associative memory designed using different methods.