A Note on a Partial Ordering for Communication Channels
Claude E. Shannon · 2009
A partial ordering is defined for discrete memoryless channels. It is transitive and is preserved under channel operations of addition and multiplication. The main result proved is that ifK1andK2are such channels, andK1¿K2, then if a code exists forK2, there exists at least as good a code forK1, in the sense of probability of error.