On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
From MaRDI portal
Publication:3931321
DOI10.1109/TIT.1981.1056396zbMath0474.94030MaRDI QIDQ3931321
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Two dimensional constacyclic codes of arbitrary length over finite fields, 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, 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\)], Information sets in abelian codes: defining sets and Groebner basis, 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, Characterizations of some two-dimensional cyclic codes correspond to the ideals of \(\mathbb{F} [x, y / < x^s - 1, y^{2^k} - 1 >\)], Extension of the Berlekamp-Massey algorithm to N dimensions, Doubly-Periodic Sequences and Two-Dimensional Recurrences, Some ring-theoretic properties of group algebras
