π
π
The Cartographer
The Berlekamp-Massey Algorithm revisited
November 21, 2022 Β· Declared Dead Β· π Applicable Algebra in Engineering, Communication and Computing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Nadia Ben Atti, Gema M. Diaz--Toca, Henri Lombardi
arXiv ID
2211.11721
Category
cs.DS: Data Structures & Algorithms
Cross-listed
math.AG
Citations
32
Venue
Applicable Algebra in Engineering, Communication and Computing
Last Checked
3 months ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted