Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

Boolean bent functions have been introduced by Rothaus in 1966, bent functions in odd
characteristic were first considered in 1985 by Kumar, Scholtz, and Welch. Two books on …

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 …

Linear codes with few weights have applications in consumer electronics, communications,
data storage systems, secret sharing, authentication codes, and association schemes. As a …

Two general constructions of linear codes with functions over finite fields have been
extensively studied in the literature. The first one is given by C (f)= Tr (af (x)+ bx) x∈\mathbb …

Projective linear codes are a special class of linear codes whose duals have minimum
distance at least 3. The columns of the generator matrix of an projective code over finite field …

Linear codes achieving or nearly achieving the Singleton bound are interesting in both
theory and practice. The objective of this paper is to construct several infinite families of …

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 …

Minimal linear codes have diverse applications in many areas such as secret sharing
schemes and secure two-party computation. There are several construction methods for …

Binary linear codes with few weights have wide applications in communication, secret
sharing schemes, authentication codes, association schemes, strongly regular graphs, etc …