Abstract:
We consider a data protection scheme where error-correcting codes can be used for efficient protection against unauthorized copying organized by coalitions of cardinality $c\in\mathbb N$ of malicious users. We find limits of range of the parameters of prospective $q$-ary Reed–Muller codes for which these codes are $c$-TA and $c$-FP codes for copyright protection.