By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daneshgaran, F. ; Dept. of Electr. & Comput. Eng., California State Univ., Los Angeles, CA, USA ; Mondin, M.

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.

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:5 )

Date of Conference:

1999