Name
Abstract | ||
|---|---|---|
Abstract The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming distance is gained, and it is possible to design efficient decoding algorithms. In this paper, we give a version of the Hartmann–Tzeng bound that works for a wide class of skew cyclic codes. We also provide a practical method for constructing them with designed distance. For skew BCH codes, which are covered by our constructions, we discuss decoding algorithms. Detailed examples illustrate both the theory as the constructive methods it supports. |
Year | Venue | DocType |
|---|---|---|
2018 | Finite Fields and Their Applications | Journal |
Volume | Citations | PageRank |
abs/1711.03515 | 2 | 0.40 |
References | Authors | |
19 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Gómez-torrecillas | 1 | 26 | 5.50 |
| Gabriel Navarro | 2 | 34 | 8.54 |
| F. J. Lobillo | 3 | 38 | 10.74 |
| Alessandro Neri | 4 | 14 | 6.10 |