Name
Abstract | ||
|---|---|---|
Polycyclic codes are a powerful generalization of cyclic and constacyclic codes. Their algebraic structure is studied here by the theory of invariant subspaces from linear algebra. As an application, a bound on the minimum distance of these codes is derived which outperforms, in some cases, the natural analogue of the BCH bound. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ffa.2020.101760 | Finite Fields and Their Applications |
Keywords | DocType | Volume |
primary,secondary | Journal | 68 |
ISSN | Citations | PageRank |
1071-5797 | 1 | 0.36 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minjia Shi | 1 | 28 | 20.11 |
| Xiaoxiao Li | 2 | 22 | 11.81 |
| Zahra Sepasdar | 3 | 1 | 0.36 |
| Patrick Solé | 4 | 636 | 89.68 |