Remarks on the SHR-Optimal State Assignment Procedure

The optimal state assignment procedure by Story, Harrison, and Reinhard [1] depends computationally on the number of distinct state assignment columsn C
di
, i = 1, 2, ..., C(R). C(R) can be computed exactly by see the [Eqa] in pdf file but a bound for C(R) is shown to be C(R) = 2
^R-1
- 1 for R - 1 =2
ⁿ
. Furthermore, for this value of R a distinct state assignment set can be tabulated instead of generated; i.e., C
di
= C
i
, i = 1, 2, ..., C(R).