 A Ghost Leg transforms an input sequence into an output sequence with the same number of elements with (possibly) different order.Thus, it can be regarded a permutation of "n" symbols, where "n" is the number of vertical lines in the Ghost Leg., hence it can be represented by the corresponding permutation matrix.Applying a Ghost Leg a finite number of times to an input sequence eventually generates an output sequence identical to the original input sequence.