Maximum distance separable codes are commonly used in large-scale distributed storage systems since they achieve the maximum fault tolerance for some given redundancy. In this paper, we focus on the repair problem of MDS codes. By stacking multiple Blaum-Roth code instances of which the parity-check matrices are judiciously designed, we construct three families of binary MDS array codes with optimal repair bandwidth for single-node failure. Specifically, codes in the first family achieve the lower bound on repair bandwidth where the number of helper nodes d is n − 1; The second family of codes are optimal-repair for any fixed d and the third are for multiple values of d simultaneously. Moreover, the last two also possess error-resilient capability and can achieve the corresponding optimal repair bandwidth. All the codes in this paper are constructed on a particular polynomial ring over binary field. Consequently, computation operations involved in node repair and file reconstruction for these codes are only XORs and cyclic shifts, avoiding complex multiplications and divisions over large finite fields.