Add to ORKGIn this paper we look at linear codes over the Galois ring GR(p^ℓ,m) with the homogeneous weight and we prove that the number of codewords with homogenous weights in a particular residue class modulo p^e are divisible by high powers of p. We also state a result for a more generalized weight on linear codes over Galois rings. We obtain similar results for the Lee weights of linear codes over F₂m+uF₂m and we prove that the results we obtain are best possible. The results that we obtain are an improvement to Wilson’s results in [Wilson RM (2003) In: Proceedings of international workshop on Cambridge linear algebra and graph coloring]
AbstractIn this paper, we give a formula as an exponential sum for a homogeneous weight defined by C...
For codes over fields, the MacWilliams equivalence theorem gives us a complete characterization when...
AbstractDelsarte showed that for any projective linear code over a finite field GF(pr) with two nonz...
In this paper we look at linear codes over the Galois ring GR(p^ℓ,m) with the homogeneous weight and...
The main focus in this thesis is linear codes over rings. In the first part, we look at linear codes...
We develop an algebraic theory of supports for \(R\)-linear codes of fixed length, where \(R\) is a ...
AbstractRecently, many papers have been published dealing with codes over finite rings. In this pape...
The definition of generalized Hamming weights (GHW) for linear codes over Galois rings is discussed....
. In [15], the second author defined algebraic geometric codes over rings. This definition was motiv...
Abstract. We give further results on the question of code optimality for linear codes over finite Fr...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
AbstractA generalized Kerdock code is a nonlinear (n,n2,[(q−1)/q](n−n))-code of length n=qm+1 over t...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
AbstractIn this paper, we give a formula as an exponential sum for a homogeneous weight defined by C...
For codes over fields, the MacWilliams equivalence theorem gives us a complete characterization when...
AbstractDelsarte showed that for any projective linear code over a finite field GF(pr) with two nonz...
In this paper we look at linear codes over the Galois ring GR(p^ℓ,m) with the homogeneous weight and...
The main focus in this thesis is linear codes over rings. In the first part, we look at linear codes...
We develop an algebraic theory of supports for \(R\)-linear codes of fixed length, where \(R\) is a ...
AbstractRecently, many papers have been published dealing with codes over finite rings. In this pape...
The definition of generalized Hamming weights (GHW) for linear codes over Galois rings is discussed....
. In [15], the second author defined algebraic geometric codes over rings. This definition was motiv...
Abstract. We give further results on the question of code optimality for linear codes over finite Fr...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
AbstractA generalized Kerdock code is a nonlinear (n,n2,[(q−1)/q](n−n))-code of length n=qm+1 over t...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
Since the paper by Hammons e.a. [1], various authors have shown an enormous interest in linear codes...
AbstractIn this paper, we give a formula as an exponential sum for a homogeneous weight defined by C...
For codes over fields, the MacWilliams equivalence theorem gives us a complete characterization when...
AbstractDelsarte showed that for any projective linear code over a finite field GF(pr) with two nonz...