  Cooperative regenerating codes are regenerating codes designed to tradeoff
storage for repair bandwidth in case of multiple node failures. Minimum storage
cooperative regenerating (MSCR) codes are a class of cooperative regenerating
codes which achieve the minimum storage point of the tradeoff. Recently, these
codes have been constructed for all possible parameters $(n,k,d,h)$, where $h$
erasures are repaired by contacting any $d$ surviving nodes. However, these
constructions have very large sub-packetization. $\epsilon$-MSR codes are a
class of codes introduced to tradeoff subpacketization level for a slight
increase in the repair bandwidth for the case of single node failures. We
introduce the framework of $\epsilon$-MSCR codes which allow for a similar
tradeoff for the case of multiple node failures. We present a construction of
$\epsilon$-MSCR codes, which can recover from two node failures, by
concatenating a class of MSCR codes and scalar linear codes. We give a repair
procedure to repair the $\epsilon$-MSCR codes in the event of two node failures
and calculate the repair bandwidth for the same. We characterize the increase
in repair bandwidth incurred by the method in comparison with the optimal
repair bandwidth given by the cut-set bound. Finally, we show the
subpacketization level of $\epsilon$-MSCR codes scales logarithmically in the
number of nodes.
