Generalized fixed points of permutations with application to estimation of minimum distance of turbo codes

In this paper we present a systematic technique for obtaining all the input sequences that are mapped by a given permutation either to themselves or to shifted versions of themselves (generically called permutation fixed points). Subsequently, we present a new class of permutations that nearly achieve the lower bound on the number of possible fixed points associated with a given permutation of prime length p.