Center of Cryptography
Center of Cryptography
News
People
Events
Publications
Projects
Sage
Archive
Contact
Light
Dark
Automatic
Complete permutations
Infinite classes of generalised complete permutations
In Pasalic et al. (2016) a construction allowing for high levels of modification was presented. It can be used to construct several important combinatorial structures, among them are examples of complete permutations. Here the method is used to …
Cite
×