On the size of pairwise-colliding permutations
Authors:
- 1 July 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2354-2358
Abstract
A structured code that improves the previously best known exponential asymptotic lower bound for the maximum cardinality of a pairwise-colliding set of permutations is presented. The main contribution is an explicit construction of an infinite recursion of pairwise-colliding sets of partial-permutations.Keywords
This publication has 5 references indexed in Scilit:
- Maximum Size of a Family of Pairwise Graph-Different PermutationsThe Electronic Journal of Combinatorics, 2017
- Permutation Capacities of Families of Oriented Infinite PathsSIAM Journal on Discrete Mathematics, 2010
- Pairwise colliding permutations and the capacity of infinite graphsSIAM Journal on Discrete Mathematics, 2006
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956