Cart (Loading....) | Create Account
Close category search window

Notes on shuffle/exchange type permutation sets

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

1 Author(s)
Shing-Tsaan Huang ; Inst. of Comput. Sci., Nat. Tsing Hua Univ., Taiwan

Properties of some shuffle/exchange type permutation sets are studied from operational points of view. The permutation sets studied are Ω, Ω-1, Ψ, L, and U; Ω and Ω-1 are, respectively, the omega and inverse omega permutation sets, Ω≡(Ω∩Ω-1); and L and U are, respectively, the admissible lower and upper triangular permutation sets. Several intuitive operations are introduced. Based on these operations, important known results relating to these sets are readdressed. The recursive nature of the sets is also discussed

Published in:

Computers, IEEE Transactions on  (Volume:39 ,  Issue: 7 )

Date of Publication:

Jul 1990

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.