Name
Abstract | ||
|---|---|---|
Let R = Z(q) + uZ(q), where q = p(s) and u(2) = 0. In this paper, minimum generating sets of cyclic codes over R are given. A necessary and sufficient condition for cyclic codes over R to be R-free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1142/S1793830915500585 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Cyclic codes, minimum generating sets, free cyclic codes | Hamming code,Discrete mathematics,Combinatorics,Hamming distance,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 4 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Gao | 1 | 29 | 20.31 |
| Fu Fang-Wei | 2 | 381 | 57.23 |
| Ling Xiao | 3 | 0 | 1.69 |
| Rama Krishna Bandi | 4 | 0 | 4.39 |