AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivides the minimum weight,pedivides all word weights. We present some illustrative applications of this result
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
The Griesmer bound is a classical technique (developed in 1960) for estimating the minimum length n ...
AbstractA new class of codes over GF(ql) that meet the Griesmer bound are constructed in a simple wa...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
Griesmer's lower bound for the word length n of a linear code of dimension k and minimum distance d ...
AbstractWe prove for a large class of parameters t and r that a multiset of at most tθd-k+rθd-k-2 po...
AbstractWe present a character-free proof of the divisible code bound and some applications
AbstractWe investigate codes meeting the Griesmer bound. The main theorem of this article is the gen...
AbstractFor any [n, k, d; q]-code the Griesmer bound says that n ⩾∑i=0k−1⌈dqi⌉. The purpose of this ...
In this paper, we generalize the theorem given by R. M. Wilson about weights modulo$p^t$in linear co...
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, in...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
The Griesmer bound is a classical technique (developed in 1960) for estimating the minimum length n ...
AbstractA new class of codes over GF(ql) that meet the Griesmer bound are constructed in a simple wa...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
AbstractWe present a brief survey of projective codes meeting the Griesmer bound. Methods for constr...
Griesmer's lower bound for the word length n of a linear code of dimension k and minimum distance d ...
AbstractWe prove for a large class of parameters t and r that a multiset of at most tθd-k+rθd-k-2 po...
AbstractWe present a character-free proof of the divisible code bound and some applications
AbstractWe investigate codes meeting the Griesmer bound. The main theorem of this article is the gen...
AbstractFor any [n, k, d; q]-code the Griesmer bound says that n ⩾∑i=0k−1⌈dqi⌉. The purpose of this ...
In this paper, we generalize the theorem given by R. M. Wilson about weights modulo$p^t$in linear co...
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, in...
AbstractIn this paper we prove that a set of points (in a projective space over a finite field of q ...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
DOI
Add to ORKG