General theory of doubly periodic arrays over an arbitrary finite field and its applications
- 1 November 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (6) , 719-730
- https://doi.org/10.1109/tit.1978.1055964
Abstract
A general theory of doubly periodic (DP) arrays over an arbitrary finite field GF(q)is presented. First the basic properties of DP arrays are examined. Next modules of linear recurring (LR) arrays are defined and their algebraic properties discussed in connection with ideals in an extension ring\tilde{R}of the ringRof bivariate polynomials with coefficients in GF(q). A finite\tilde{R}-module of DP arrays is shown to coincide with the\tilde{R}-module of LR arrays dermed by a zero-dimensional ideal in\tilde{R}. Equivalence relations between DP arrays are explored, i.e., rearrangements of arrays by means of unimodular transformations. Decimation and interleaving of arrays are defined in a two-dimensional sense. The general theory is followed by application to irreducible LR arrays. Among irreducible arrays,M-arrays are a two-dimensional analog ofM-sequences and may be constructed fromM-sequences by means of unimodular transformations. The results of this paper are also important in studying properties of Abelian codes.Keywords
This publication has 6 references indexed in Scilit:
- Pseudo-random sequences and arraysProceedings of the IEEE, 1976
- Two-dimensional Fire codesIEEE Transactions on Information Theory, 1973
- A theory of two-dimensional linear recurring arraysIEEE Transactions on Information Theory, 1972
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian GroupBell System Technical Journal, 1970
- Semisimple cyclic and Abelian codes. IICybernetics and Systems Analysis, 1970
- Linear Recurring SequencesJournal of the Society for Industrial and Applied Mathematics, 1959