General theory of doubly periodic arrays over an arbitrary finite field and its applications
From MaRDI portal
Publication:4180272
DOI10.1109/TIT.1978.1055964zbMath0396.94016MaRDI QIDQ4180272
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
PolynomialIdealModulesFinite FieldCyclic CodesDoubly Periodic ArraysFinite Commutative RingPeriodic Sequences
Finite fields and commutative rings (number-theoretic aspects) (11T99) Polynomials over finite fields (11T06) Other types of codes (94B60) Cyclic codes (94B15) Other special types of modules and ideals in commutative rings (13C13) Polynomials and finite commutative rings (13M10)
Related Items
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, Linear recurring sequences over modules, Linear recurring sequences over rings and modules, Product of spaces of doubly periodic arrays, Well-behaved basis and LR arrays, Module structure of doubly periodic arrays over finite fields, 2-D skew-cyclic codes over \(\mathbb F_q[x,y;\rho ,\theta\)], Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings., Applications of the theory of Gröbner bases to the study of linear recurring arrays, Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring, Doubly-periodic sequences and a class of two-dimensional cyclic codes, Extension of the Berlekamp-Massey algorithm to N dimensions, On the linear complexity for multidimensional sequences, The equivalence classes of LR arrays, Maximal Periodic Two-Dimensional Arrays Over Galois Rings, Doubly-Periodic Sequences and Two-Dimensional Recurrences
