Secret sharing schemes from binary linear codes (Q621578): Difference between revisions

This paper deals with the applications of linear codes to secret sharing schemes. The questions related to determining the access structure for such schemes, in general, is a difficult problem. The paper goes on to describe minimal access sets for certain classes of linear codes and then proves that the secret sharing schemes so obtained are democratic in the sense that every participant is involved in the same number of minimal access sets. The paper under review seems to have connections with the concept of defining sets in block designs and this is perhaps worth exploring.