Name
Abstract | ||
|---|---|---|
In this paper, we study cyclic codes over the Galois ring ${\rm GR}({p^2},s)$. The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length $p^a$ over ${\rm GR}({p^2},s)$. Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over ${\rm GR}({p^2},s)$. Some corrections to results on Euclidean self-dual cyclic codes of even length over $\mathbb{Z}_4$ in Discrete Appl. Math. 128, (2003), 27 and Des. Codes Cryptogr. 39, (2006), 127 are provided. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Discrete mathematics,Combinatorics,Algebra,Galois rings,Enumeration,Euclidean geometry,Discrete Fourier transform,Hermitian matrix,Mathematics |
DocType | Volume | Citations |
Journal | abs/1401.6634 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Somphong Jitman | 1 | 57 | 14.05 |
| San Ling | 2 | 5 | 1.14 |
| Ekkasit Sangwisut | 3 | 5 | 2.60 |