2008/01/25 by Lizhen Yang, Yang, Lizhen, Kefei Chen +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.0801.3987
arxiv created 2008/01/25 · openalex publication_date 2008/01/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A permutation array(permutation code, PA) of length n and distance d, denoted by (n,d) PA, is a set of permutations C from some fixed set of n elements such that the Hamming distance between distinct members x,y∈ C is at least d. In this correspondence, we present two constructions of PA from fractional polynomials over finite field, and a construction of (n,d) PA from permutation group with degree n and minimal degree d. All these new constructions produces some new lower bounds for PA.