全部 标题 作者
关键词 摘要


Upper Bound of Code-word Number of Some Separating Codes

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

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

comments powered by Disqus