Calculation of the number of complete mappings for permutations

Cybernetics and Systems Analysis

Volumn 36, Issue 2, 2000, Pages 244-247

  Novakovich, D ^a  

^a LONDON METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Complete mapping; Permutation; Weight of permutation

Indexed keywords

EID: 33746997497     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF02678671     Document Type: Article

References (5)

1. C. Cooper and I. M. Kovalenko, "The upper bound tor the number of complete mappings," Teoriya Imovirnostei ta Mat. Statysiyka, 53, 69-75 (1995).
2. I. N. Kovalenko, "Upper bound on the number of complete maps." Kibern. Sist. Anal., No. 1, 81-85 (1996).
3. C. Cooper. R. Gilchrist, I. N. Kovalenko, and D. Novakovic, "Estimation of the number of "good" permutations, with applications to cryptography." Kibern. Sist. Anal.. No. 5, 10-16 (1999).
4. R. Gilkrist and I. N. Kovalenko, "On estimation of the probability of absence of collisions of some random mappings," Kibern. Sist. Anal., No. 1, 132-137 (2000).
5. A. A. Levitskaya, "A combinatorial problem in the class of permutations over ring Z, of odd modulo n residues," Probl. Upravl. Inform., No. 5, 99-109 (1996).