Add to ORKGAbstract. For an [n, k, d]q code C, we define a mapping wC from PG(k − 1, q) to the set of weights of C via a generator matrix of C. We give a geometric aspect derived from wC to investigate the extendability of linear codes. We survey known extension theorems and some recent results.
AbstractFor an [n,k,d]4 code C with d odd, we define the diversity of C as the 3-tuple (Φ0,Φ1,Φ2) wi...
A linear [n, k] code of length n and dimension k over Fq = GF (q) is a k-dimensional vector subspace...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1,...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
AbstractAn [n,k,d]q code is called w-weight (mod q) if there are w integers i1,i2,…,iw∈{0,1,2,…,q−1}...
In this short note we state how we construct new good linear codes C over the finite field with q el...
. Various forms of the extension problem are discussed for linear codes defined over finite rings. T...
AbstractFor an [n,k,d]q code C with k⩾3, gcd(d,q)=1, the diversity of C is defined as the pair (Φ0,Φ...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
We construct some optimal linear codes over Fq through projective geometry, using the geometric meth...
This paper discusses the foundations of the theory of linear codes defined over finite modules. Two ...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
International audienceWe study the combinatorial function L(k, q), the maximum number of nonzero wei...
AbstractFor an [n,k,d]4 code C with d odd, we define the diversity of C as the 3-tuple (Φ0,Φ1,Φ2) wi...
A linear [n, k] code of length n and dimension k over Fq = GF (q) is a k-dimensional vector subspace...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1,...
AbstractR. Hill and P. Lizak (1995, in “Proc. IEEE Int. Symposium on Inform. Theory, Whistler, Canad...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
AbstractAn [n,k,d]q code is called w-weight (mod q) if there are w integers i1,i2,…,iw∈{0,1,2,…,q−1}...
In this short note we state how we construct new good linear codes C over the finite field with q el...
. Various forms of the extension problem are discussed for linear codes defined over finite rings. T...
AbstractFor an [n,k,d]q code C with k⩾3, gcd(d,q)=1, the diversity of C is defined as the pair (Φ0,Φ...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
We construct some optimal linear codes over Fq through projective geometry, using the geometric meth...
This paper discusses the foundations of the theory of linear codes defined over finite modules. Two ...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
International audienceWe study the combinatorial function L(k, q), the maximum number of nonzero wei...
AbstractFor an [n,k,d]4 code C with d odd, we define the diversity of C as the 3-tuple (Φ0,Φ1,Φ2) wi...
A linear [n, k] code of length n and dimension k over Fq = GF (q) is a k-dimensional vector subspace...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1,...