The Weight Distribution of C5(1, n)

Kwok Yan Lam, Francesco Sica

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In [2] the codes Cq(r, n) over double-struck F signq were introduced. These linear codes have parameters [2n, ∑i=0r (in), 2n-r], can be viewed as analogues of the binary Reed-Muller codes and share several features in common with them. In [2], the weight distribution of C3(1, n) is completely determined. In this paper we compute the weight distribution of C5(1, n). To this end we transform a sum of a product of two binomial coefficients into an expression involving only exponentials and Lucas numbers. We prove an effective result on the set of Lucas numbers which are powers of two to arrive to the complete determination of the weight distribution of C5(1, n). The final result is stated as Theorem 2.

Original languageEnglish
Pages (from-to)181-191
Number of pages11
JournalDesigns, Codes, and Cryptography
Volume24
Issue number2
DOIs
Publication statusPublished - Oct 1 2001

Keywords

  • Lucas numbers
  • Weight distribution

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The Weight Distribution of C<sub>5</sub>(1, n)'. Together they form a unique fingerprint.

Cite this