Pages that link to "Item:Q583882"
From MaRDI portal
The following pages link to Extension of the Berlekamp-Massey algorithm to N dimensions (Q583882):
Displaying 30 items.
- On the joint linear complexity profile of explicit inversive multisequences (Q558009) (← links)
- On the structure of order domains (Q700167) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting (Q862559) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Joint linear complexity of multisequences consisting of linear recurring sequences (Q1032485) (← links)
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring (Q1180162) (← links)
- A Gröbner basis technique for Padé approximation (Q1190745) (← links)
- Solving a congruence on a graded algebra by a subresultant sequence and its application (Q1209629) (← links)
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I (Q1286655) (← links)
- The expected value of the joint linear complexity of periodic multisequences (Q1394937) (← links)
- The key equation for one-point codes and efficient error evaluation (Q1602655) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- Finding recursions for multidimensional arrays (Q1854502) (← links)
- Linear recurring sequences over rings and modules (Q1915326) (← links)
- Linear feedback shift registers and the minimal realization problem (Q2002558) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Multidimensional linear complexity analysis of periodic arrays (Q2304655) (← links)
- Arrays composed from the extended rational cycle (Q2397495) (← links)
- Evaluation codes defined by finite families of plane valuations at infinity (Q2436567) (← links)
- Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\) (Q2500604) (← links)
- The expectation and variance of the joint linear complexity of random periodic multisequences (Q2577529) (← links)
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences (Q2628309) (← links)
- On the evaluation codes given by simple \(\delta \)-sequences (Q2634585) (← links)
- Использование $2$-линейного регистра сдвига для выработки псевдослучайных последовательностей (Q5152340) (← links)
- Analysis and computation of multidimensional linear complexity of periodic arrays (Q6130614) (← links)