 Monotonic codes are useful in the theory of interconnection networks, especially for minimizing dilation for linear arrays of processors.If we define the "weight" of a binary string to be the number of 1s in the string, then although we clearly cannot have a Gray code with strictly increasing weight, we may want to approximate this by having the code run through two adjacent weights before reaching the next one.We can formalize the concept of monotone Gray codes as follows