Extension of the Berlekamp-Massey algorithm to N dimensions

From MaRDI portal
Publication:583882

DOI10.1016/0890-5401(90)90039-KzbMath0692.68024MaRDI QIDQ583882

Shojiro Sakata

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)




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