Minimal Linear Codes with Few Weights and Their Secret Sharing

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

International Journal of Information Security Science
Volume:8 Issue:4
Minimal Linear Codes with Few Weights and Their Secret Sharing

Minimal Linear Codes with Few Weights and Their Secret Sharing

Authors : Sıhem MESNAGER, Ahmet SINAK, Oguz YAYLA

Pages : 77-87

View : 38 | Download : 9

Publication Date : 2019-12-01

Article Type : Research Paper

Abstract :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.
Keywords : Minimal linear code, weakly regular plateaued function, secret sharing scheme

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.