The Berlekamp-Massey Algorithm revisited

11/21/2022
by   Nadia Ben Atti, et al.
0

We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to explain it in a simpler way and to adapt it to lazy evaluation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2020

A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence

We present a simple and fast algorithm for computing the N-th term of a ...
research
03/17/2017

Roots multiplicity without companion matrices

We show a method for constructing a polynomial interpolating roots' mult...
research
11/12/2021

Multiway Storage Modification Machines

We present a parallel version of Schönhage's Storage Modification Machin...
research
06/09/2018

A fast algorithm for solving linearly recurrent sequences

We present an algorithm which computes the D^th term of a sequence satis...
research
03/25/2020

Polynomial Kernels for Paw-free Edge Modification Problems

Let H be a fixed graph. Given a graph G and an integer k, the H-free edg...
research
03/16/2017

A modification to Hirsch index allowing comparisons across different scientific fields

The aim of this paper is to propose a simple modification to the origina...
research
01/02/2020

A Comparative Evaluation of Pitch Modification Techniques

This paper addresses the problem of pitch modification, as an important ...

Please sign up or login with your details

Forgot password? Click here to reset