2013/01/04 by Fei Gao, Yiting Yang, Gennian Ge · 1 citation
Engineering · Computer Science · #graph theory and CDMA systems #Coding theory and cryptography #Advanced Wireless Communication Techniques
paper · doi:10.1109/tit.2013.2237945
openalex publication_date 2013/01/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Permutation codes have been shown to be useful in power line communications, block ciphers, and multilevel flash memory models. Construction of such codes is extremely difficult. In fact, the only general lower bound known is the Gilbert-Varshamov type bound. In this paper, we establish a connection between permutation codes and independent sets in certain graphs. Using the connection, we improve the Gilbert-Varshamov bound asymptotically by a factor log(n), when the code lengthngoes to infinity.