Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes
This is an incremental theoretical contribution to coding theory with potential applications in digital watermarking and copyright protection.
The paper investigates separation properties and bounds for collusion-secure fingerprinting codes, obtaining a new existence result for (w1, w2)-separating codes and discussing the optimality of upper bounds, while also studying relationships between separation and non-trivial subspace subcodes for Reed-Solomon codes.
In this paper we investigate the separation properties and related bounds of some codes. We tried to obtain a new existence result for $(w_1, w_2)$-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.