Linear codes from weakly regular plateaued functions and their secret sharing schemes

Mesnager S., ÖZBUDAK F. , Sinak A.

DESIGNS CODES AND CRYPTOGRAPHY, vol.87, pp.463-480, 2019 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 87
  • Publication Date: 2019
  • Doi Number: 10.1007/s10623-018-0556-4
  • Page Numbers: pp.463-480


Linear codes, the most significant class of codes in coding theory, have diverse applications in secret sharing schemes, authentication codes, communication, data storage devices and consumer electronics. The main objectives of this paper are twofold: to construct three-weight linear codes from plateaued functions over finite fields, and to analyze the constructed linear codes for secret sharing schemes. To do this, we generalize the recent contribution of Mesnager given in (Cryptogr Commun 9(1):71-84, 2017). We first introduce the notion of (non)-weakly regular plateaued functions over Fp, with p being an odd prime. We next construct three-weight linear p-ary (resp. binary) codes from weakly regular p-ary plateaued (resp. Boolean plateaued) functions and determine their weight distributions. We finally observe that the constructed linear codes are minimal for almost all cases, which implies that they can be directly used to construct secret sharing schemes with nice access structures. To the best of our knowledge, the construction of linear codes from plateaued functions over Fp, with p being an odd prime, is studied in this paper for the first time in the literature.