Decoding the Johnson code by 2-output comparator circuits

The problem of decoding the n-bit Johnson code to decimal numbers is discussed. For an odd number n, a systematic procedure is possible utilising n 2-input 2-output comparator circuits. A theorem is stated and proved for the nonexistence of such a procedure when n is even.