“…On the one hand, these characterizations of correctable codes provide the motivation for some of the characterizations of generalized multiplicative domains that are derived. On the other hand, we feel that they are of independent interest, as they generalize several known results for noiseless subsystems and decoherence-free subspaces [12,16,18,20,24,26,33,34], including the multiplicative domain results of [9] and the commutant relationships of [10,15]. In particular, it was recently shown that the standard multiplicative domain of a completely positive trace-preserving (CPTP) map encodes a subclass of what are known as "unitarily correctable codes" [9,22,23,31] (UCC).…”