2000 character limit reached
Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes
Published 23 Apr 2013 in cs.CR, cs.IT, and math.IT | (1304.6161v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
