Upper Bound of Code-word Number of Some Separating Codes

In this paper, We study upper bounds for separating codes. First, some new upper bound for restricted separating codes is proposed. Finally, we illustrate that the Upper Bound Conjecture for separating Reed-Solomon codes inherited from Silverberg’s question holds true for almost all Reed-Solomon codes.