Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes
Cryptography and Security
2013-07-30 v2 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.1304.6161,
title = {Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes},
author = {Myong-Son Sihn and Ryul Kim},
journal= {arXiv preprint arXiv:1304.6161},
year = {2013}
}
Comments
Withdrawn by authors because the proof of theorem 2.1 is not correct and most of results are coincided with those of arXiv:1208.2076