2010/04/29 by Natalia Silberstein, Tuvi Etzion, Silberstein, Natalia +1
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1004.5195
openalex publication_date 2010/04/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we consider the existence of nontrivial perfect codes in the Johnson graph J(n,w). We present combinatorial and number theory techniques to provide necessary conditions for existence of such codes and reduce the range of parameters in which 1-perfect and 2-perfect codes may exist.