A lemma on binomial coefficients and applications to Lee weights modulo 2 e of codes over ℤ 4

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this work, we prove that if C is a free ℤ 4-module of rank κ in ℤ 4 n, and j ε ℤ and e ≤ 1, then the number of codewords in C with Lee weight congruent to j modulo 2 e is divisible by 2⌊κ-2 e-2/2 e-2⌋. We prove this result by introducing a lemma and applying the lemma in one of the theorems proved by Wilson. The method used is different than the one used in our previous work on Lee weight enumerators in which more general results were obtained. Moreover, Wilson's methods are used to prove that the results obtained are sharp by calculating the power of 2 that divides the number of codewords in the trivial code ℤ 4 κ with Lee weight congruent to j modulo 2 e.

Original languageEnglish (US)
Pages (from-to)177-185
Number of pages9
JournalDesigns, Codes, and Cryptography
Volume65
Issue number3
DOIs
StatePublished - Dec 2012
Externally publishedYes

Keywords

  • Lee weight
  • Weight distribution
  • ℤ -codes

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A lemma on binomial coefficients and applications to Lee weights modulo 2 e of codes over ℤ 4'. Together they form a unique fingerprint.

Cite this