Publication date
April 2001
DOI Publisher
Academic Press. ISSN
0097-3165 Citation count (estimate)
4Abstract
AbstractWe present a character-free proof of the divisible code bound and some applications
AbstractWe present a character-free proof of the divisible code bound and some applications
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula...
AbstractWe establish an upper bound for the minimum distance of a divisible code in terms of its dua...
AbstractAn appropriate version of the linear programming bound of Delsarte for binary codes is used ...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
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...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
AbstractWe present a character-free proof of the divisible code bound and some applications
AbstractWe use shortened and punctured codes to give an elementary proof of a combinatorial identity...
Abstract. This paper surveys parts of the study of divisibility proper-ties of codes. The survey beg...
Counting polynomial techniques introduced by Wilson are used to provide analogs of a theorem of McEl...
We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given ...
AbstractThe Gleason-Pierce theorem characterizes those fields for which formally self-dual divisible...
AbstractAll solutions in positive integers of the equation of the title are found, under the restric...
For q,n,d∈N, let Aq(n,d) be the maximum size of a code C⊆[q]n with minimum distance at least d. We g...
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula...
AbstractWe establish an upper bound for the minimum distance of a divisible code in terms of its dua...
AbstractAn appropriate version of the linear programming bound of Delsarte for binary codes is used ...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
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...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
AbstractWe present a character-free proof of the divisible code bound and some applications
AbstractWe use shortened and punctured codes to give an elementary proof of a combinatorial identity...
Abstract. This paper surveys parts of the study of divisibility proper-ties of codes. The survey beg...
Counting polynomial techniques introduced by Wilson are used to provide analogs of a theorem of McEl...
We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given ...
AbstractThe Gleason-Pierce theorem characterizes those fields for which formally self-dual divisible...
AbstractAll solutions in positive integers of the equation of the title are found, under the restric...
For q,n,d∈N, let Aq(n,d) be the maximum size of a code C⊆[q]n with minimum distance at least d. We g...
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula...
AbstractWe establish an upper bound for the minimum distance of a divisible code in terms of its dua...
AbstractAn appropriate version of the linear programming bound of Delsarte for binary codes is used ...
Add to ORKG