The Weight Distribution of C
5(1, n) |
| |
| Authors: | Kwok Yan Lam Francesco Sica |
| |
| Institution: | (1) School of Computing, National University of Singapore, Lower Kent Ridge Road, Singapore, 119260;(2) UCL Cryto Group, Universite Catholique, de Louvain, Place du levant 3, Louvain-la-neuve, Belgium, B-1348 |
| |
| Abstract: | In 2] the codes C
q
(r,n) over
were introduced. These linear codes have parameters
![$$2^n ,\sum\nolimits_{i = 0}^r {\left( {_i^n } \right),2^{n - r} ]} $$](/content/t0814145140n8288/10623_2004_Article_353904_TeX2GIFIE2.gif)
, 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 C
3(1,n) is completely determined.In this paper we compute the weight distribution of C
5(1,n). To this end we transform a sum of a product of two binomial coefficients into an expression involving only exponentials an 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 C
5(1,n). The final result is stated as Theorem 2. |
| |
| Keywords: | weight distribution Lucas numbers |
| 本文献已被 SpringerLink 等数据库收录！ |
|
