Discrete helpers/walsh perm

A Walsh permutation is a periodic permutation (Perm) that is derived from an invertible binary matrix.





The attribute  is not inherited.

The complement patterns differ by degree. But the distance from the highest element $$2^{degree} - 1$$ is always the same