Extension of the Berlekamp-Massey algorithm to N dimensions
From MaRDI portal
Publication:583882
DOI10.1016/0890-5401(90)90039-KzbMath0692.68024MaRDI QIDQ583882
Publication date: 1990
Published in: Information and Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
Related Items
Polynomial-division-based algorithms for computing linear recurrence relations, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, On the evaluation codes given by simple \(\delta \)-sequences, The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting, Arrays composed from the extended rational cycle, Linear recurring sequences over rings and modules, Error linear complexity measures for multisequences, The expected value of the joint linear complexity of periodic multisequences, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Computing syzygies in finite dimension using fast linear algebra, Analysis and computation of multidimensional linear complexity of periodic arrays, Evaluation codes defined by finite families of plane valuations at infinity, Sparse FGLM algorithms, Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring, Использование $2$-линейного регистра сдвига для выработки псевдослучайных последовательностей, A Gröbner basis technique for Padé approximation, Linear feedback shift registers and the minimal realization problem, Solving a congruence on a graded algebra by a subresultant sequence and its application, On the structure of order domains, New codes for the Berlekamp-Massey-Sakata algorithm, On the joint linear complexity profile of explicit inversive multisequences, Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\), Syndrome series of one point algebraic-geometric codes and majority voting scheme, Block-Krylov techniques in the context of sparse-FGLM algorithms, Periodic multisequences with large error linear complexity, Multidimensional linear complexity analysis of periodic arrays, Guessing Gröbner bases of structured ideals of relations of sequences, Joint linear complexity of multisequences consisting of linear recurring sequences, A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I, The expectation and variance of the joint linear complexity of random periodic multisequences, Finding recursions for multidimensional arrays, The key equation for one-point codes and efficient error evaluation
Cites Work
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Rational approximation of 2-D linear discrete systems
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
- A theory of two-dimensional cyclic codes
- General theory of doubly periodic arrays over an arbitrary finite field and its applications
- Impulse response arrays of discrete-space systems over a finite field
- Shift-register synthesis and BCH decoding
- The Enumeration of Information Symbols in BCH Codes
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
