One important component of network reprogramming is code dissemination, when the updated program code is distributed to the relevant nodes. Very few code dissemination protocols tolerate transient faults that corrupt the state and these faults can cause the old code to disseminate in the network. We propose two protocols called BestEffort-Repair and Consistent-Repair that transform faultintolerant code dissemination protocols into non-masking fault-tolerant protocols where, eventually, all nodes obtain the new code. We conduct experiments with both protocols on TelosB-like motes and over TOSSIM simulations to show their correctness and also their performance. We conduct a case study whereby both protocols are added to a state-of-the-art code dissemination protocol, viz. Varuna to evaluate their impact on Varuna. Our results show that (i) Varuna, which is fault-intolerant, is transformed into a stabilizing code dissemination protocol (ii) they induce low overhead on Varuna, and causes all nodes to eventually receive the new code. BestEffort-Repair is biased towards fast recovery whereas Consistent-Repair attempts to reduce the number of erroneous downloads in the network. Our main contribution is the first corrector protocols that correct code dissemination in the presence of transient faults.