Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes
Abstract
In this paper we investigate the separation properties and related bounds of some codes. We tried to obtain a new existence result for (w1, w2)-separating codes and discuss the "optimality" of the upper bounds. Next we tried to study some interesting relationship between separation and existence of non-trivial subspace subcodes for Reed-Solomon codes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.