Archivio Istituzionale della RicercaIn 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 lowerbound on the number of possible fixed points associated with a given permutation of prime length p.
Generalized fixed points of permutations with application to estimation of minimum distance of turbo codes / F., Daneshgaran; Mondin, Marina. - STAMPA. - 5:(1999), pp. 2566-2570. (Intervento presentato al convegno GLOBECOM '99 tenutosi a Rio De janeiro, Brazil nel 5-9 December, 1999) [10.1109/GLOCOM.1999.831764].
Generalized fixed points of permutations with application to estimation of minimum distance of turbo codes
MONDIN, Marina
1999
Abstract
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 lowerbound on the number of possible fixed points associated with a given permutation of prime length p.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1679163
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo