Regenerating codes represent a class of block codes applicable for distributed storage systems. The $[n,k,d]$ regenerating code has data recovery capability while possessing arbitrary $k$ out of $n$ code fragments, and supports the capability for code fragment regeneration through the use of other arbitrary $d$ fragments, for $k\leq d\leq n-1$ . Minimum storage regenerating (MSR) codes are a subset of regenerating codes containing the minimal size of each code fragment. The first explicit construction of MSR codes that can perform exact regeneration (named exact-MSR codes) for $d\geq 2k-2$ has been presented via a product-matrix framework. This paper addresses some of the practical issues on the construction of exact-MSR codes. The major contributions of this paper include as follows. A new product-matrix framework is proposed to directly include all feasible exact-MSR codes for $d\geq 2k-2$ . The mechanism for a systematic version of exact-MSR code is proposed to minimize the computational complexities for the process of message-symbol remapping. Two practical forms of encoding matrices are presented to reduce the size of the finite field.