Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
From MaRDI portal
Publication:1180162
DOI10.1016/0166-218X(91)90115-DzbMath0747.94008MaRDI QIDQ1180162
Publication date: 27 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
polynomialinteger residue ring\(n\)-dimension array\(n\)-dimensional linear feedback shift registerencoders and decoders of Abelian codes
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Algebraic decoder of multidimensional convolutional code: Constructive algorithms for determining syndrome decoder and decoder matrix based on Gröbner basis, Applications of the theory of Gröbner bases to the study of linear recurring arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- A generalization of reduction rings
- Shift Register Synthesis (Modulo m)
- On BCH codes over arbitrary integer tings (Corresp.)
- On codes over<tex>Z_m</tex>(Corresp.)
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
- Codes over integer residue rings
- A theory of two-dimensional cyclic codes
- Codes over Zm, revisited
- General theory of doubly periodic arrays over an arbitrary finite field and its applications
- Shift-register synthesis and BCH decoding
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
