MDS secret-sharing scheme secure against cheaters

For the problem of cheaters in secret-sharing schemes, we introduce d_cheat which is more appropriate than the minimum Hamming distance d_min of the related error-correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identity the cheaters in the scheme). We then prove that d _min⩽d_cheat=n-max/B∉Γ|B| where Γ denotes the access structure