Cyclic codes and minimal strong Gröbner bases over a principal ideal ring. (Q1870034): Difference between revisions

Let \(R\) be a principal ideal ring. \(R\) is a finite direct product of principal ideal domains and Artinian chain rings (an Artinian chain ring is an Artinian local ring whose maximal ideal is principal). The authors show that a finite set \(G\subset R[x]\setminus\{0\}\) is a minimal strong Gröbner basis iff \(G= \{r_0g_0,\dots, r_sg_s\}\) for some \(r_i\in R\) and \(g_i\in R[x]\) such that, for \(i= 0,\dots, s-1\), (1) \(Rr_i\supset Rr_{i+1}\); (2) \(g_0,\dots, g_s\) have the same leading coefficient \(r\) which is not a zero-divisor; (3) \(\deg(g_i)> \deg(g_{i+1})\) and (4) \(r_{i+1} g_i\in (r_{i+1} g_{i+1},\dots, r_sg_s)\). This result was known when \(R\) is a principal ideal domain (the authors refer to \textit{D. Lazard} [J. Symb. Comput. 1, 261--270 (1985; Zbl 0616.68036)] and to \textit{G. Szekeres} [Am. Math. Mon. 59, 379--386 (1952; Zbl 0047.03303)]). So they prove it firstly when \(R\) is an Artinian chain ring. As a byproduct, they obtain, in this case, a description of cyclic codes of length \(n\) over \(R\), i.e., of ideals of the ring \(R[x]/(x^n- 1)\), which generalizes a result of \textit{A. R. Calderbank} and \textit{N. J. A. Sloane} [Des. Codes Cryptography 6, 21--35 (1995; Zbl 0848.94020)], who considered the case \(R= \mathbb{Z}/p^k\mathbb{Z}\). The proofs are based on previous results of \textit{G. H. Norton} and \textit{A. Salagean} [Bull. Aust. Math. Soc. 64, 505--528 (2001; Zbl 1046.13019)].