Linear recurring arrays, linear systems and multidimensional cyclic codes over quasi-frobenius rings

Acta Applicandae Mathematicae

Volumn 80, Issue 2, 2004, Pages 175-198

  Lu, Peizhong ^a   Liu, Mulan ^b   Oberst, Ulrich ^c  

^a FUDAN UNIVERSITY   (China)

^b INSTITUTE OF SYSTEMS SCIENCE   (China)

^c UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

Annihilating ideal; Cyclic code; Duality; Linear recurring array; Multidimensional linear system; Nullstellensatz; Quasi frobenius ring

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); INVERSE PROBLEMS; LINEAR ALGEBRA; POLES AND ZEROS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

ALGEBRAIC CODES; LINEAR RECURRING ARRAYS; MULTIDIMENSIONAL CYCLIC CODES; QUASI-FROBENIUS RINGS;

LINEAR SYSTEMS;

EID: 1442336161     PISSN: 01678019     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:ACAP.0000013854.77539.53     Document Type: Article

References (26)

1. Adams, W. W. and Loustaunau, P.: An Introduction to Gröbner Bases, Amer. Math. Soc., Providence, RI, 1994.
2. Atiyah, M. F. and Macdonald, I. G.: Introduction to Commutative Algebra, Addison-Wesley, 1969.
3. Calderbank, A. R. and Sloane, J. A.: Modular and p-adic cyclic codes, Designs, Codes Cryptogr. 6 (1995), 21-35.
4. Heij, C.: Exact modelling and identifiability of linear systems, Automatica 28(2) (1992), 325-344.
5. Heiligman, M. and Fu, D.: A characterization of zero-dim, annihilators of tableaus, J. Algebra 193 (1997), 748-756.
6. m, Finite Fields Appl. 3 (1997), 334-352.
7. Kurakin, V. L., Kuzmin, A. S., Markov, V. T., Mikhalev, A. V. and Nechaev, A. A.: Linear codes and polylinear recurrences over finite rings and modules (a survey), In AAECC'13, Lecture Notes in Comput. Sci. 1752, 1999, pp. 365-391.
8. Lam, T. Y.: Lectures on Modules and Rings, Springer-Verlag, New York, 1999.
9. Lu, P. and Liu, M.: A formula to determine zero-dimensional ideal being annihilating ideals of LRAs, Algebra Colloq. 6(3) (1999).
10. Lu, P.: A criterion for annihilating ideals of linear recurring sequences over galois rings, Appl. Algebra Engrg. Comm. Comput. 11(2) (2000), 141-156.
11. Lu, P.: On Macaulay's inverse systems over QF rings, Chinese Ann. of Math. A 22(2) (2001), 217-222.
12. Macaulay, F. S.: The Algebraic Theory of Modular Systems, Cambridge Univ. Press, 1916.
13. Matlis, E.: Injective modules over Noetherian rings, Pacific J. Math. 8 (1958), 511-528.
14. Mikhalev, A. V. and Nechaev, A. A.: Linear recurrence sequences over modules, Acta Appl. Math. 42 (1996), 161-202.
15. Nechaev, A. A.: Linear recurrence sequences over commutative rings, Discrete Math. Appl. 2(6) (1992), 659-683.
16. Northcott, D. G.: Injective envelopes and inverse polynomials, J. London Math. Soc. (2) 8 (1974), 290-296.
17. Norton, G. H. and Salagean, A.: One structure of linear and cyclic codes over a finite chain rings, Appl. Algebra Engrg. Comm. Comput. 10 (2000), 489-506.
18. Oberst, U.: Multidimensional constant linear system, Acta Appl. Math. 20 (1990), 1-175.
19. Oberst, U.: Finite dimensional systems of partial differential or difference equations, Adv. Appl. Math. (1996).
20. Oberst, U.: Variations on the fundamental principle for linear systems of partial differential and difference equations with constant coefficients, Appl. Algebra Engr. Comm. Comput. 6 (1995), 211-243.
21. Oberst, U.: On the minimal number of trajectories determining a multi-dimensional system, Math. Control Signals Systems 6 (1993), 264-288.
22. Piras, F.: Some remarks on the inverse systems of polynomial modules, J. Pure Appl. Algebra 129 (1998), 87-99.
23. Pyndiah, R.: Near-optimum decoding of product codes, block turbo codes, IEEE Trans. on Comm. 46(8) (1998), 1003-1010.
24. Shankar, S.: The Nullstellensatz for systems of PDE, Adv. Appl. Math. 23 (1999), 360-374.
25. Zampieri, S.: A behavioral approach to identifiability of 2D scalar systems, Automatica 33(1) (1997), 49-61.
26. Wan, Z. X.: Cyclic codes over Galois rings, Algebra Colloq. 6(3) (1999), 291-304.