On n-Dimensional Sequences I

Let R be a commutative ring and let n ? 1. We study ?(s), the generating function and Ann(s), the ideal of characteristic polynomials of s, an n-dimensional sequence over R .We express f(X1,?,Xn) · ?(s)(X-11,?,X-1n) as a partitioned sum. That is, we give (i) a 2n-fold "border" partition (ii) an explicit expression for the product as a 2n-fold sum; the support of each summand is contained in precisely one member of the partition. A key summand is so(f, s), the "border polynomial" of f and s, which is divisible by X1 ? Xn.We say that s is eventually rectilinear if the elimination ideals Ann(s)?RXi] contain an fi (Xi) for 1 ? i ? n. In this case, we show that Ann(s) is the ideal quotient (?ni=1(fi) : so(f, s)/(X1 ? Xn )).When R and RX1, X2 ,?, Xn]] are factorial domains (e.g. R a principal ideal domain or FX1,?, Xn]), we compute the monic generator ?i of Ann(s) ? RXi] from known fi ? Ann(s) ? RXi] or from a finite number of 1-dimensional linear recurring sequences over R. Over a field F this gives an O(?ni=1 ??3i) algorithm to compute an F-basis for Ann(s).

[1]  Graham H. Norton,et al.  The n-dimensional key equation and a decoding application , 1994, IEEE Trans. Inf. Theory.

[2]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[3]  Gui Liang Feng,et al.  A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.

[4]  P. Vijay Kumar,et al.  4-phase Sequences with Near-optimum Correlation Properties , 1992, IEEE Trans. Inf. Theory.

[5]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[6]  Dongdai Lin,et al.  Linear Recurring m-Arrays , 1988, EUROCRYPT.

[7]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[8]  N. Zierler Linear Recurring Sequences , 1959 .

[9]  Linear recurring sequences and the path weight enumerator of a convolutional code , 1991 .

[10]  Steven Homer,et al.  Doubly-Periodic Sequences and Two-Dimensional Recurrences , 1985 .

[11]  B. Buchberger,et al.  Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[12]  N. Bose,et al.  Impulse response arrays of discrete-space systems over a finite field , 1982 .

[13]  Shojiro Sakata,et al.  On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals , 1981, IEEE Trans. Inf. Theory.

[14]  Rudolf Lide,et al.  Finite fields , 1983 .

[15]  Graham H. Norton Some Decoding Applications of Minimal Realization , 1995, IMACC.

[16]  Hideki Imai,et al.  A Theory of Two-Dimensional Cyclic Codes , 1977, Inf. Control..

[17]  Shojiro Sakata,et al.  Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array , 1988, J. Symb. Comput..

[18]  F. Piras,et al.  On the continuous dual of a polynomial bialgebra , 1991 .

[19]  Graham H. Norton,et al.  On the Minimal Realizations of a Finite Sequence , 1995, J. Symb. Comput..

[20]  Harald Niederreiter,et al.  Sequences With Almost Perfect Linear Complexity Profile , 1987, EUROCRYPT.

[21]  R. Fossum The Divisor Class Group of a Krull Domain , 1973 .

[22]  Alain Lascoux Suites récurrentes linéaires , 1986 .

[23]  R. McEliece Finite field for scientists and engineers , 1987 .

[24]  Graham H. Norton,et al.  Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence , 1990, IEEE Trans. Inf. Theory.

[25]  Shojiro Sakata,et al.  Extension of the Berlekamp-Massey Algorithm to N Dimensions , 1990, Inf. Comput..

[26]  Pingzhi Fan,et al.  Maximal length sequences over Gaussian integers , 1994 .

[27]  Shojiro Sakata General theory of doubly periodic arrays over an arbitrary finite field and its applications , 1978, IEEE Trans. Inf. Theory.

[28]  R. Haskins Mathematics for the analysis of algorithms (2nd ed.) , 1986, Proceedings of the IEEE.

[29]  Robert A. Scholtz,et al.  Continued fractions and Berlekamp's algorithm , 1979, IEEE Trans. Inf. Theory.