Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes
Myong-Son Sihn, Ryul Kim
TL;DR
This paper explores the separation properties of certain codes, establishing new existence results for separating codes and examining bounds and relationships with Reed-Solomon codes.
Contribution
It introduces new existence results for $(w_1, w_2)$-separating codes and analyzes their bounds and connections to subspace subcodes of Reed-Solomon codes.
Findings
New existence results for separating codes
Analysis of bounds and optimality
Relationship between separation and Reed-Solomon subcodes
Abstract
In this paper we investigate the separation properties and related bounds of some codes. We tried to obtain a new existence result for -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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Biometric Identification and Security · Internet Traffic Analysis and Secure E-voting