Chrome Extension
WeChat Mini Program
Use on ChatGLM
VIPCreated with Sketch.

On The Size Of Pairwise-Colliding Permutations

János Körner,Chandra Nair,David Ng

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)（2019）

Cited 1|Views11
No score
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.
More
Translated text
Key words
graph capacity, permutation codes, extremal combinatorics
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined