To avoid possible dependence among coded packets, most research works of random linear network coding suggest encoding packets over a Galois field with enough many elements, e.g., GF (28) or GF (216). However, Galois operations are with higher computational cost than ordinary integer operations. On the other hand, random Boolean network coding, based on the Boolean algebra in which XOR is the only operation needed for encoding and encoding, is a computation-friendly random network coding scheme but at the same time suffered for the possible dependence among coded packets. In this work, a hybrid coding scheme is proposed. Most coded packets are encoded over the Boolean field and only a few augmented coded packets, more precisely 4 packets, are needed to be encoded over the Galois field. Both the computational efficiency and bandwidth effectiveness are taken into consideration. The proposed scheme is theoretically verified by probabilistic analysis.