Abstract
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 Reed-Solomon 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. Also, we show how the strategy we propose can be applied to other cases by proving the equivalence of both properties for a particular code of characteristic 2. This answers a question posted by Silverberg et al. (2001, 2003), for a large family of Reed-Solomon codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
