Name
Abstract | ||
|---|---|---|
We construct an infinite family of three-Lee-weight codes of dimension 2m, where m is singly-even, over the ring (mathbb {F}_{p}+umathbb {F}_{p}) with u 2=0. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. By Gray mapping, we obtain an infinite family of abelian p-ary three-weight codes. When m is odd, and p≡3 (mod 4), we obtain an infinite family of two-weight codes which meets the Griesmer bound with equality. An application to secret sharing schemes is given. |
Year | Venue | Field |
|---|---|---|
2017 | Cryptography and Communications | Abelian group,Discrete mathematics,Combinatorics,Secret sharing,Algebraic structure,Gauss sum,Weight distribution,Mathematics,Griesmer bound |
DocType | Volume | Issue |
Journal | 9 | 5 |
Citations | PageRank | References |
5 | 0.52 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minjia Shi | 1 | 28 | 20.11 |
| Rongsheng Wu | 2 | 9 | 4.67 |
| Yan Liu | 3 | 241 | 73.08 |
| Patrick Solé | 4 | 636 | 89.68 |