In this paper, we develop a symbolic algorithm to find all admissible linear network coding schemes over the binary field that are resilient to adversarial erasures. Such codes are required to be resilient to any erasure patterns in a given collection. Our algorithm is based on the binary characteristic set method, which can be used to derive the equivalence conditions for the symbolic matrices over the binary field to have full rank, thereby guaranteeing the decodability of the codes.