Abstract
We study finitely generated and finite systems defined by linear partial difference equations with constant coefficients in a Noetherian ring. The two notions coincide for finite rings, and we show that all finite systems exhibit certain periodicity properties. For the particular case of systems over the ring of integers modulo m > 1, which is important in coding theory, a method is given for determining the number of trajectories, using Gröbner basis techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams W. W., Loustaunau P. (1994) An introduction to Gröbner bases. American Mathematical Society, Providence
Fagnani F., Zampieri S. (2001) System-theoretic properties of convolutional codes over rings. IEEE Transactions on Information Theory 47: 2256–2274
Fornasini E., Rocha P., Zampieri S. (1993) State space realization of 2-D finite-dimensional behaviours. SIAM Journal on Control and Optimization 31: 1502–1517
Gluesing-Luerssen H., Rosenthal J., Weiner P. A. (2001) Duality between multidimensional convolutional codes and systems. In: Colonius et al. F. (eds) Advances in Mathematical Systems Theory. Birkhäuser, Boston
Greferath M., Nechaev A., Wisbauer R. (2004) Finite quasi-Frobenius modules and linear codes. Journal of Algebra and Its Applications 3: 247–272
Greuel, G. -M., Pfister, G., & Schönemann, H. (2009). Singular 3.1.0—A computer algebra system for polynomial computations. http://www.singular.uni-kl.de
Kuijper M., Pinto R., Polderman J. W. (2007) The predictable degree property and row reducedness for systems over a finite ring. Linear algebra and its applications 425: 776–796
Kuijper, M., & Schindelar, K. (2009). Gröbner bases and behaviors over finite rings. In Proceedings of 48th IEEE Conference on Decision and Control (CDC). Shanghai, China.
Kurakin, V. L., Kuzmin, A. S., Markov, V. T., Mikhalev, A. V., & Nechaev, A. A. (1999). Linear codes and polylinear recurrences over finite rings and modules (a survey). In M. Fossorier et al. (Ed.), Applied algebra, algebraic algorithms and error correcting codes. Lecture Notes Computer Science 1719. Springer.
Lam, T. Y. (1999). Lectures on Modules and Rings. Springer.
Lu P., Liu M., Oberst U. (2004) Linear recurring arrays, linear systems and multidimensional cyclic codes over quasi-Frobenius rings. Acta Applicandae Mathematicae 80: 175–198
Norton G. H., Salagean A. (2001) Strong Gröbner bases for polynomials over a principal ideal ring. Bulletin of the Australian Mathematical Society 64: 505–528
Oberst U. (1996) Finite dimensional systems of partial differential or difference equations. Advances in Applied Mathematics 17: 337–356
Pauer F. (2007) Gröbner bases with coefficients in rings. Journal of Symbolic Computation 42: 1003–1011
Rosenthal, J. (2001). Connections between linear systems and convolutional codes. In: B. Marcus et al. (Ed.) Codes, Systems, and Graphical Models. IMA Vol. Math. Appl. 123. Springer.
Wagner, L. (2009). Residue class rings modulo polynomial ideals over coefficient rings. B. Sc. Thesis, RWTH Aachen University.
Wood J. A. (1999) Duality for modules over finite rings and applications to coding theory. American Journal of Mathematics 121: 555–575
Zerz E. (2007) Discrete multidimensional systems over \({\mathbb{Z}_n}\). Systems and Control Letters 56: 702–708
Zerz E. (2008) The discrete multidimensional MPUM. Multidimensional Systems and Signal Processing 19: 307–321
Zerz, E. (2010). On multidimensional convolutional codes and controllability properties of multidimensional systems over finite rings. Asian Journal of Control, 12, 119–126.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zerz, E., Wagner, L. Finite multidimensional behaviors. Multidim Syst Sign Process 23, 5–15 (2012). https://doi.org/10.1007/s11045-010-0101-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11045-010-0101-8