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 pr...Show MoreMetadata
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.
Date of Conference: 07-12 July 2019
Date Added to IEEE Xplore: 26 September 2019
ISBN Information:
Contents 