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

Date

2019-03-01

Author

Mesnager, Sihem
Özbudak, Ferruh
Sinak, Ahmet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

305
views

0
downloads

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.

Subject Keywords

Binary linear codes, Linear p-ary codes, Secret sharing schemes, Weakly regular plateaued functions, Weight distribution

URI

https://hdl.handle.net/11511/35115

Journal

DESIGNS CODES AND CRYPTOGRAPHY

DOI

https://doi.org/10.1007/s10623-018-0556-4

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Two or Three Weight Linear Codes from Non-Weakly Regular Bent Functions Özbudak, Ferruh; Pelen, Rumi Melih (2022-05-01) © 1963-2012 IEEE.Linear codes with few weights have applications in consumer electronics, communications, data storage systems, secret sharing, authentication codes, and association schemes. As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure computation of data between two parties. The construction of minimal linear codes with new and desirable parameters is an interesting research topic in coding theory and cryptography. Recently, Mesnager et.a...
A Combinatorial Methodology for Optimizing Non-Binary Graph-Based Codes: Theoretical Analysis and Applications in Data Storage Hareedy, Ahmed; Lanka, Chinmayi; Guo, Nian; Dolecek, Lara (2019-04-01) © 2018 IEEE.Non-binary (NB) low-density parity-check (LDPC) codes are graph-based codes that are increasingly being considered as a powerful error correction tool for modern dense storage devices. Optimizing NB-LDPC codes to overcome their error floor is one of the main code design challenges facing storage engineers upon deploying such codes in practice. Furthermore, the increasing levels of asymmetry incorporated by the channels underlying modern dense storage systems, e.g., multi-level Flash systems, exa...
Non-Binary LDPC Codes for Magnetic Recording Channels: Error Floor Analysis and Optimized Code Design Hareedy, Ahmed; Amiri, Behzad; Galbraith, Rick; Dolecek, Lara (2016-08-01) © 2016 IEEE.In this paper, we provide a comprehensive analysis of the error floor along with code optimization guidelines for structured and regular non-binary low-density parity-check (NB-LDPC) codes in magnetic recording (MR) applications. While the topic of the error floor performance of binary LDPC codes over additive white Gaussian noise (AWGN) channels has recently received considerable attention, very little is known about the error floor performance of NB-LDPC codes over other types of channels, des...
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes Lopez-Permouth, Sergio R.; Ozadam, Hakan; Özbudak, Ferruh; SZABO, Steve (2013-01-01) Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p(a), m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding such sets in the case that a = 2 is given. This explicitly gives the Hamming distance of all cyclic codes of le...
Minimum order linear system identification and parameter estimation with application Erdoğan, Onur Cem; Balkan, Raif Tuna; Platin, Bülent Emre; Department of Mechanical Engineering (2014) Design, control, and investigation of complex systems require a tool to understand and model system behavior. This tool is the system identification, which convert the system response to a mathematical formulation. During the identification phase, the utilized model is important to convey system behavior. In this study, a number of minimum order and non-parametric system identification algorithms are implemented for the identification of linear time invariant mechanical systems. For this purpose, impulse re...

Citation Formats

S. Mesnager, F. Özbudak, and A. Sinak, “Linear codes from weakly regular plateaued functions and their secret sharing schemes,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 463–480, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35115.