Complete weight enumerators of a class of linear codes with two weights

In this paper, a class of $p$-ary linear codes with two weights is constructed by using the properties of cyclotomic classes of ${\mathbb{F}}_{p^2}^1$. The complete weight enumerators of these linear codes are also determined. In some cases, they are optimal and can be employed to obtain secret sharing schemes with interesting access structures and asymptotically optimal systematic authentication codes.     

Two-weight and three-weight linear codes based on Weil sums

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their weight distributions are determined using Weil sums. Some of the linear codes obtained are optimal or almost optimal with respect to the Griesmer bound.     

Complete weight enumerators of a family of three-weight linear codes

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 family of p-ary linear codes constructed with defining set. The weight enumerator is an immediate result of the complete weight enumerator, which shows that the codes proposed in this paper are three-weight linear codes. Additionally, all nonzero codewords are minimal and thus they are suitable for secret sharing.     

Complete weight enumerators of a class of linear codes with two or three weights

We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they have at most three weights and they are suitable for applications in secret sharing schemes. This is an extension of the results raised by Wang et al. (2017).     

Two classes of two-weight linear codes

Two-weight linear codes have many wide applications in authentication codes, association schemes, strongly regular graphs, and secret sharing schemes. In this paper, we present two classes of two-weight binary or ternary linear codes. In some cases, they are optimal or almost optimal. They can also be used to construct secret sharing schemes.     

Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents

In this paper, we explicitly determine Hamming weight enumerators of several classes of multi-twisted codes over finite fields with at most two non-zero constituents, where each non-zero constituent has dimension 1. Among these classes of multi-twisted codes, we further identify two classes of optimal equidistant linear codes that have nice connections with the theory of combinatorial designs and several other classes of minimal linear codes that are useful in constructing secret sharing schemes with nice access structures. We also illustrate our results with some examples.     

Complete weight enumerators of a class of linear codes

Let \(\mathbb {F}_{q}\) be the finite field with \(q=p^{m}\) elements, where p is an odd prime and m is a positive integer. For a positive integer t, let \(D\subset \mathbb {F}^{t}_{q}\) and let \({\mathrm {Tr}}_{m}\) be the trace function from \(\mathbb {F}_{q}\) onto \(\mathbb {F}_{p}\). In this paper, let \(D=\{(x_{1},x_{2},\ldots ,x_{t}) \in \mathbb {F}_{q}^{t}\setminus \{(0,0,\ldots ,0)\} : {\mathrm {Tr}}_{m}(x_{1}+x_{2}+\cdots +x_{t})=0\},\) we define a p-ary linear code \(\mathcal {C}_{D}\) by

$$\begin{aligned} \mathcal {C}_{D}=\{\mathbf {c}(a_{1},a_{2},\ldots ,a_{t}) : (a_{1},a_{2},\ldots ,a_{t})\in \mathbb {F}^{t}_{q}\}, \end{aligned}$$

where

$$\begin{aligned} \mathbf {c}(a_{1},a_{2},\ldots ,a_{t})=({\mathrm {Tr}}_{m}(a_{1}x^{2}_{1}+a_{2}x^{2}_{2}+\cdots +a_{t}x^{2}_{t}))_{(x_{1},x_{2},\ldots ,x_{t}) \in D}. \end{aligned}$$

We shall present the complete weight enumerators of the linear codes \(\mathcal {C}_{D}\) and give several classes of linear codes with a few weights. This paper generalizes the results of Yang and Yao (Des Codes Cryptogr, 2016).

     

Two-weight or three-weight binary linear codes from cyclotomic mappings

Recently, linear codes with few weights have been studied extensively. These linear codes have wide applications in secret sharing schemes and authentication codes. In this paper, we introduce a new construction of defining sets using cyclotomic mappings and construct three new classes of binary linear codes with two or three weights. We also explicitly determine the weight distributions of these codes.     

Relative generalized Hamming weights of cyclic codes

Relative generalized Hamming weights (RGHWs) of a linear code with respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the linear codes. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems. In this paper, we investigate the RGHWs of cyclic codes of two nonzeros with respect to its irreducible cyclic subcodes. We give two formulae for RGHWs of the cyclic codes. As applications of the formulae, explicit examples are computed. Moreover, RGHWs of cyclic codes in the examples are very large, comparing with the generalized Plotkin bound of RGHWs. So it guarantees very high security for the secret sharing scheme based on the dual codes.     

The structure of linear codes of constant weight

In this paper we determine completely the structure of linear codes over of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theorem for virtual linear codes of constant weight. Existence is settled on a case by case basis.

     

Weight distributions and weight hierarchies of two classes of binary linear codes

Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of a linear code has many applications such as on the type II wire-tap channel, dealing with t-resilient functions and trellis or branch complexity of linear codes and so on. In this paper, we present a formula for computing the weight hierarchies of linear codes constructed by the generalized method of defining sets. Then, we construct two classes of binary linear codes with a few weights and determine their weight distributions and weight hierarchies completely. Some codes of them can be used in secret sharing schemes.     

A formula on the weight distribution of linear codes with applications to AMDS codes

The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and codes with small Singleton's defect. We propose a new set of linear relations that must be satisfied by the coefficients of the weight distribution. From these relations we are able to derive known identities (in an easier way) for interesting cases, such as extremal codes, Hermitian codes, MDS and NMDS codes. Moreover, we are able to present for the first time the weight distribution of AMDS codes. We also discuss the link between our results and the Pless equations.     

Generalized Hamming weights of three classes of linear codes

The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the generalized Hamming weights of three classes of linear codes constructed through defining sets and determine them partly for some cases. Particularly, in the semiprimitive case we solve a problem left in Yang et al. (2015) [30].     

Difference sets and three-weight linear codes from trinomials

We confirm a conjecture of Cunsheng Ding claiming that the punctured value-sets of a list of eleven trinomials over odd-degree extensions of the binary field give rise to difference sets with Singer parameters. In the course of confirming the conjecture, we show that these trinomials share the remarkable property that every element of the value-set of each trinomial has either one or four preiamges. We also give the partial resolution of another conjecture of Cunsheng Ding claiming that linear codes constructed from those eleven trinomials are three-weight.