Add to ORKGBy an optimal linear code we mean that it has the highest minimum distance with a prescribed length and dimension. We construct several families of optimal linear codes over the finite field IFp by making use of down-sets generated by one maximal element of IFP. "Moreover, we show that these families of optimal linear codes are minimal and contain relative two-weight linear codes, and have applications to secret sharing schemes and wire-tap channel of type II with the coset coding scheme, respectively. (C) 2018 Elsevier B.V. All rights reserved.1
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
It is possible for a linear block code to provide more protection for selected message positions tha...
In this paper, we shall consider a problem of constructing an optimal linear code whose code length ...
By an optimal linear code we mean that it has the highest minimum distance with a prescribed length ...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
In this short note we state how we construct new good linear codes C over the finite field with q el...
Recently, some infinite families of minimal and optimal binary linear codes were constructed from si...
We consider the problem of designing optimal linear codes (in terms of having the largest minimum di...
Linear codes with a few weights have been extensively studied due to their wide applications in secr...
For the purpose of error correcting linear codes over a finite field GF (q) and fixed dimension k we...
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence ...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
We construct some optimal linear codes over Fq through projective geometry, using the geometric meth...
Linear codes have widespread applications in data storage systems. There are two major contribution...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
It is possible for a linear block code to provide more protection for selected message positions tha...
In this paper, we shall consider a problem of constructing an optimal linear code whose code length ...
By an optimal linear code we mean that it has the highest minimum distance with a prescribed length ...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
In this short note we state how we construct new good linear codes C over the finite field with q el...
Recently, some infinite families of minimal and optimal binary linear codes were constructed from si...
We consider the problem of designing optimal linear codes (in terms of having the largest minimum di...
Linear codes with a few weights have been extensively studied due to their wide applications in secr...
For the purpose of error correcting linear codes over a finite field GF (q) and fixed dimension k we...
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence ...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
We construct some optimal linear codes over Fq through projective geometry, using the geometric meth...
Linear codes have widespread applications in data storage systems. There are two major contribution...
In this paper, we classify all optimal linear [n; n=2; d] codes over Z 4 up to length 8, and determi...
It is possible for a linear block code to provide more protection for selected message positions tha...
In this paper, we shall consider a problem of constructing an optimal linear code whose code length ...