Minimal linear codes have important applications in secure communications, including in the
framework of secret sharing schemes and secure multi-party computation. A lot of research …

In this article, we propose several generic methods for constructing minimal linear codes
over the prime field. The first construction uses the direct sum of an arbitrary function and a …

Vectorial Boolean functions and codes are closely related and interconnected. On the one
hand, various requirements of binary linear codes are needed for their theoretical interests …

Linear codes over finite chain rings meeting the Griesmer bound are particularly interesting
since they are closely related to minihyper in projective Hjelmslev spaces. In this paper …

Minimal codes are characterized by the property that none of the codewords is covered by
some other linearly independent codeword. We first show that the use of a bent function g in …

Minimal binary linear codes are a special class of binary codes with important applications
in secret sharing and secure two-party computation. These codes are characterized by the …

Constructing minimal linear codes has a great interest in coding theory since they have an
important role in describing access structures in secret sharing schemes and they are …

The construction of (minimal) linear codes has received much attention, especially from
cryptographic functions owing to the desirable properties of these functions. One application …

In this paper, for n≥ 6, we present the generic construction of binary linear codes of length 2
n-1 with dimension n+ 3, and derive the necessary and sufficient condition for the …

Linear codes are an important class of codes in coding theory and have been extensively
studied due to their significant applications (including the design of secret sharing schemes) …