2015/04/20 by Faruk Göloğlu, Jüri Lember, Göloğlu, Faruk +5
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.1504.05100
To be presented at ISIT 2015, 5 pages
arxiv created 2015/04/20 · openalex publication_date 2015/04/20 · arxiv updated 2015/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths. Second, several probabilistic lower bounds are developed, which improve on the known lower bounds for large minimum distances. The results of a computer search for permutation codes are also presented.