Weights modulo p e of linear codes over rings

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


In 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 script F sign2m+u script F sign2m 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].

Original languageEnglish (US)
Pages (from-to)147-165
Number of pages19
JournalDesigns, Codes, and Cryptography
Issue number2-3
StatePublished - Jun 2007
Externally publishedYes


  • Galois rings
  • Homogeneous weights
  • Lee weights
  • Linear codes

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Weights modulo p e of linear codes over rings'. Together they form a unique fingerprint.

Cite this