A note on the equivalence of the traceability properties of Reed-Solomon codes for certain coalition sizes
José E. Moreira, Marcel Fernández, Miguel Soriano · 2009
Fingerprinting codes are used to prevent dishonest users from redistributing copyrighted material. In this context, codes with the traceability (TA) property are of remarkable significance, since they provide an efficient way to identify traitors. Codes with the identifiable parent property (IPP) are also capable of identifying traitors, requiring less restrictive conditions than the TA codes at the expense of not having an efficient decoding algorithm, in the general case. Other codes that have been widely studied but possess a weaker traitor-tracing capability are the secure frameproof codes (SFP). It is a well-known result that TA implies IPP and IPP implies SFP. The converse is in general false. However, it has been conjectured that for Reed-Solomon codes all three properties are equivalent. In this paper we investigate this equivalence, and provide a positive answer for families of Reed-Solomon codes when the number of traitors divides the size of the code field.