Abstract | ||
---|---|---|
Cyclic codes over finite field have been studied for decades due to their wide applications in communication and storage systems. However their weight distributions are known only in a few cases. In this paper, we investigate a class of p-ary cyclic codes whose duals have three zeros, where p is an odd prime. The weight distributions of the class of cyclic codes for all distinct cases are determined explicitly. The results indicate that these codes contain five-weight codes, seven-weight codes and eleven-weight codes. Some of these codes are optimal. Moreover, the covering structures of the class of codes are considered and being used to construct secret sharing schemes. |
Year | DOI | Venue |
---|---|---|
2019 | 10.3934/amc.2019008 | ADVANCES IN MATHEMATICS OF COMMUNICATIONS |
Keywords | DocType | Volume |
Finite field,cyclic code,weight distribution,covering structure,secret sharing scheme | Journal | 13 |
Issue | ISSN | Citations |
1 | 1930-5346 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lanqiang Li | 1 | 3 | 1.74 |
Shixin Zhu | 2 | 216 | 37.61 |
Li Liu | 3 | 1 | 1.04 |