Multiple-edge-fault tolerance with respect to hypercubes

Previous works on edge-fault tolerance with respect to hypercubes Q/sub n/ are mainly focused on 1-edge fault and 2- or 3-edge fault with limited size of n. We give a construction scheme for 2-EFT(Q/sub n/) graphs and 3-EFT(Q/sub n/) graphs, where n is arbitrarily large. In our constructions, approximately log n extra degree is added to the vertices of Q/sub n/ for 2-edge-fault tolerance, and one more degree for 3-edge-fault tolerance.