Weights modulo \(p^e\) of linear codes over rings (Q2384022): Difference between revisions

Recently, a lot of work has been done on linear codes over Galois rings. In this paper, the number of codewords of a certain ``homogeneous weight'' are studied. It is shown that the number of codewords in a linear code over \(\text{GR}(p^l,m)\) whose homogeneous weight is in a certain congruence class modulo \(p^e\) for certain \(e\), is divisible by a large power of \(p\). The results are best possible in the sense that there are codes such that the respective numbers are divisible exactly by these powers of \(p\). The results in the paper are based on and generalize work of \textit{R. M. Wilson} [Discrete Math. 306, No. 23, 3154--3165 (2006; Zbl 1156.11009)].