Some connections between self-dual codes, combinatorial designs and secret sharing schemes
Stefka Bouyuklieva, Zlatko Varbanov · Advances in Mathematics of Communications · 2011
In the present work we study a class of singly-even self-dualcodes with the special property that the minimum weight of theirshadow is 1. Some of these codes support 1 and 2-designs. Usingthem, we describe two types of schemes based on codes, the firstis an one-part secret sharing scheme and the second is a two-partsharing scheme. Similar schemes can be constructed from self-dualcodes that support 3-designs.