Almost separating and almost secure frameproof codes over q-ary alphabets
Rights accessOpen Access
In this paper we discuss some variations of the notion of separating code for alphabets of arbitrary size. We show how the original definition can be relaxed in two different ways, namely almost separating and almost secure frameproof codes, yielding two different concepts. The new definitions enable us to obtain codes of higher rate, at the expense of satisfying the separating property partially. These new definitions become useful when complete separation is only required with high probability, rather than unconditionally. We also show how the codes proposed can be used to improve the rate of existing constructions of families of fingerprinting codes.
The final publication is available at Springer via http://dx.doi.org/10.1007/s10623-015-0060-z
CitationMoreira, J., Fernandez, M., Kabatiansky, G. Almost separating and almost secure frameproof codes over q-ary alphabets. "Designs codes and cryptography", 27 Març 2015, vol. 80, núm. 1, p. 11-28.