Name
Abstract | ||
|---|---|---|
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring R = F-2 + vF(2) + v(2)F(2)where v(3) = 1. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when m is odd and m > 1. They are cubic, that is to say quasi-cyclic of co-index three. An application to secret sharing schemes is given. |
Year | Venue | Keywords |
|---|---|---|
2016 | APPLIED AND COMPUTATIONAL MATHEMATICS | Trace Codes,Three-Weight Codes,Griesmer Bound,Secret Sharing Schemes |
Field | DocType | Volume |
Abelian group,Discrete mathematics,Combinatorics,Secret sharing,Algebraic structure,Binary code,Binary linear codes,Linear code,Mathematics | Journal | 17 |
Issue | ISSN | Citations |
2.0 | 1683-3511 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minjia Shi | 1 | 1 | 2.43 |
| Hongwei Zhu | 2 | 0 | 1.35 |
| Patrick Solé | 3 | 636 | 89.68 |