Product-matrix (PM) code[1] 

Code constructed using two explicit constructions, with each construction corresponding to one of the two extreme points of the storage-bandwidth trade-off curve [2].

For the MBR point, the parameters of the code are \([n,k, n-1 \ge d\ge k, \alpha, \beta = \frac{\alpha}{d}, M= kd-\binom{k}{2}]\). For the MSR point, the parameters of the code are \([n,k,d \ge 2k-2, \alpha, \beta = \frac{\alpha}{d-k+1}, M=k\alpha]\).

PM codes are the first explicit constructions for all values of the system parameters \([n,k,d]\) at the MBR point, and for all parameters satisfying \([n,k,d \ge 2k-2]\) at the MSR point. Both constructions are based on a common product-matrix frame work which make them easy to implement.