Minimal linear codes with few weights have significant applications in secure two-party computation and secret sharing schemes. In this paper, we construct two-weight and three-weight minimal linear codes by using weakly regular plateaued functions in the well-known construction method based on the second generic construction. We also give punctured codes and subcodes for some constructed minimal codes. We finally obtain secret sharing schemes with high democracy from the dual codes of our minimal codes.
Minimal linear code weakly regular plateaued function secret sharing scheme
Birincil Dil | İngilizce |
---|---|
Bölüm | Araştırma Makalesi |
Yazarlar | |
Yayımlanma Tarihi | 1 Aralık 2019 |
Yayımlandığı Sayı | Yıl 2019 Cilt: 8 Sayı: 4 |