%0 Journal Article
%T Upper Bound of Code-word Number of Some Separating Codes
%A Ryul Kim
%A Myong-son Sihn
%A Ok-hyon Song
%J Journal of Theoretical Physics and Cryptography
%D 2013
%I University of Mohaghegh Ardabili
%X 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.
%K Separating code
%K Fingerprinting
%K SilverbergĄ¯s question.
%U http://www.ijtpc.org/volume2/JTPC1440.pdf