AbstractThis paper describes how to compute the largest power of the prime p dividing all the word weights of codes in a class including the powers of the radicals of group algebras of p-groups over finite fields of characteristics p. In the group algebra case, the computation requires finding the optimal solution of a bin-packing problem. Standard algorithms provide it when the group is Abelian
Abstract. This paper surveys parts of the study of divisibility proper-ties of codes. The survey beg...
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, in...
We present a new class of optimal (n, k) group codes over the general finito field GF(q), q, a prime...
AbstractThis paper describes how to compute the largest power of the prime p dividing all the word w...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
AbstractWe prove that the automorphism group of Generalized Reed-Muller codes is the general linear ...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an o...
Several authors have established that many classical codes are ideals in certain ring constructions....
Error correcting codes of all (k, p) group codes (p odd), i.e., linear mappings of k-tuples of zeros...
AbstractWe identify the largest integer λ such that all weights in a p-ary cyclic code C are divisib...
Several authors have established that many classical codes are ideals in certain ring constructions....
In the first part of this paper linear, quadratic,…arbitrary n-block codes are studied by means of a...
Several authors have established that many classical codes are ideals in certain ring constructions....
Counting polynomial techniques introduced by Wilson are used to provide analogs of a theorem of McEl...
Abstract. This paper surveys parts of the study of divisibility proper-ties of codes. The survey beg...
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, in...
We present a new class of optimal (n, k) group codes over the general finito field GF(q), q, a prime...
AbstractThis paper describes how to compute the largest power of the prime p dividing all the word w...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
AbstractWe prove that the automorphism group of Generalized Reed-Muller codes is the general linear ...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an o...
Several authors have established that many classical codes are ideals in certain ring constructions....
Error correcting codes of all (k, p) group codes (p odd), i.e., linear mappings of k-tuples of zeros...
AbstractWe identify the largest integer λ such that all weights in a p-ary cyclic code C are divisib...
Several authors have established that many classical codes are ideals in certain ring constructions....
In the first part of this paper linear, quadratic,…arbitrary n-block codes are studied by means of a...
Several authors have established that many classical codes are ideals in certain ring constructions....
Counting polynomial techniques introduced by Wilson are used to provide analogs of a theorem of McEl...
Abstract. This paper surveys parts of the study of divisibility proper-ties of codes. The survey beg...
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, in...
We present a new class of optimal (n, k) group codes over the general finito field GF(q), q, a prime...
DOI
Add to ORKG