On the IPP Properties of Reed-Solomon Codes

Codes with traceability properties are used in schemes where the identification of users that illegally redistribute content is required. For any code with traceability properties, the Identifiable Parent Property (c-IPP) seems to be less restrictive than the Traceability (c-TA) property. In this paper, we show that for ReedSolomon codes both properties are in many cases equivalent. More precisely, we show that for an [n,k,d] Reed-Solomon code, defined over a field that contains the n−d roots of unity, both properties are equivalent. This answers a question posted by Silverberg et al. in [10, 11], for a large family of Reed-Solomon codes.