1. A computer program for assigning data states to stores defining mapping relationships in a mapping system mapping input states to output states and which assigns each input state to an A superstate within an A group of superstates and to a B superstate within a B group of superstates, each superstate including a plurality of input states, the computer program comprising the steps of: assigning in succession a plurality of B superstates, each having at least one input state which is to be mapped included therein, to a BK by BT B map having a plurality of BK states and a plurality of BT states orthogonal to and intersecting each of the BK states with not more than a predetermined maximum number of input states to be mapped being assignable to any given BT state, the B superstates being assigned to the B map with at most one B superstate assigned to any given Bk, BT intersection and being preferentially assigned to a BT state having a greatest number of vacancies available to receive input states to be mapped; and assigning in succession a plurality of A superstates, each having at least one input state which is to be mapped included therein, to an AK by AT A map having a plurality of AK states and a plurality of AT states orthogonal to and intersecting each of the AK states with not more than a predetermined maximum number of input states to be mapped being assignable to any given AT state, the A superstates being assigned to the A map with at most one A superstate assigned to any given Ak, AT intersection and with each successive A superstate being preferentially assigned to an AT state having the smallest number of vacancies available to receive input states which are to be mapped.