Academic Journals Database
Disseminating quality controlled scientific knowledge

Upper Bound of Code-word Number of Some Separating Codes

ADD TO MY LIST
 
Author(s): Ryul Kim | Myong-son Sihn | Ok-hyon Song

Journal: Journal of Theoretical Physics and Cryptography
ISSN 2322-3138

Volume: 2;
Issue: 1;
Start page: 23;
Date: 2013;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Separating code | Fingerprinting | Silverberg’s question.

ABSTRACT
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.
Why do you need a reservation system?      Affiliate Program