Abstract : Reshaping of arrays is a convenient programming primitive. For arrays encoded in a binary reflected gray code reshaping implies code change. We show that an axis splitting, or combining of two axes, requires communication in exactly one dimension, and that for multiple axis splittings the exchanges in the different dimensions can be ordered arbitrarily. We present two algorithms that vary incomplexity.