Secret sharing schemes based on the dual of Golay codes (Q2121024)

Secret sharing schemes are structures which allow a secret to be shared among a number of participants such that only specified subsets of the participants can unlock the secret. The authors describe two secret sharing schemes based on linear codes which are the duals of \([23,12,7]_2\) and \([11,6,5]_3\) Golay codes. They determine the minimal access structure of these schemes and show that they are \(3\)-democratic, that is every group of \(3\) participants is in the same number of minimal authorized sets. They use their results to correct errors in the existing literature of the minimal access structure that used the \([24,12,8]_2\) and \([12,6,6]_3\) Golay codes.