Homogeneous Weights modulo prime powers of Linear Codes over Galois Rings - Bahattin Yildiz

I introduce the notion of a homogeneous weight for linear codes over Galois rings and I prove that for a linear code C over Galois rings, the number of codewords in C with homogeneous weights that are in a certain congruence class modulo p^e is divisible by high powers of p depending on the type of the code which is an improvement to the result obtained by Wilson in his work in 2002. I also state a result for a class of weights that are more general than the homogeneous weights and that in particular generalize the Hamming weights.