In this paper, a class of two-weight and three-weight linear codes over GF (p) is constructed,
and their application in secret sharing is investigated. Some of the linear codes obtained are …

In this paper, error-correcting codes from perfect nonlinear map**s are constructed, and
then employed to construct secret sharing schemes. The error-correcting codes obtained in …

In this paper, a class of binary three-weight linear codes is constructed. Their dual codes are
also studied. The dual codes are either optimal or almost optimal. These codes have …

There are several approaches to the construction of authentication codes without secrecy
using error correcting codes. In this paper, we describe one approach and construct several …

Linear codes have been an interesting topic in both theory and practice for many years. In
this paper, for an odd prime p, we present the explicit complete weight enumerator of a …

Minimal linear codes have interesting applications in secret sharing schemes and secure
two-party computation. This paper uses characteristic functions of some subsets of F q to …

In this paper, we construct a large family of projective linear codes over from the general
simplicial complexes of via the defining-set construction, which generalizes the results of …

In this paper, we construct new infinite families of codes over the ring R= F 2+ u F 2+ v F 2+
uv F 2, u 2= v 2= 0, uv= vu by employing simplicial complexes. When the simplicial …

Recently, linear codes constructed from defining sets have been studied extensively. They
may have a few weights if the defining set is chosen properly. Let m and t be positive …

In this paper, we construct four families of linear codes over finite fields from the
complements of either the union of subfields or the union of cosets of a subfield, which can …