In a $2^m$ factorial design, search designs are considered for searching and estimating some non-zero interactions based on search linear models. There are some criteria for comparing search designs. Computing these criteria is a heavy task In this paper, we provide the SD package for the numerical computing environment MATLAB to compute these criteria and also to check Srivastava's condition for a given design. The package is illustrated by an example
