C++ Reed Solomon Error Correcting Library https://www.schifra.com
Python implementation of LFSR and Berlekamp-Massey algorithm.
C implementation of the Berlekamp-Massey Algorithm
Reed-Solomon Encoder, using Berlekamp-Massey, Forney Algorithms.
This repository contains a CUDA/C++ implementation of a distinct algorithmic approach for finding the linear recurrence relation (with least possible order) of a real-valued, noisy 1D sequence in near-linear time.
The Berlekamp-Massey (BM) Algorithm is an Iterative Method used to Find the Shortest Linear Feedback Shift Register (LFSR) that can Generate a Given Sequence of Numbers
My project during EE720 (Number Theory and Cryptography) Autumn 2021-22
tests of implementation of the Berlekamp-Massey algorithm for finding the shortest LFSR reproducing a given sequence
A Julia package for computations related to the Prym-Green conjecture
A javascript implementation of various modulo 2 matrix algebra tools, including an implementation of the Berlekamp-Massey algorithm
Find the minimum-order linear recurrence relation in noisy 1D sequences using a GPU-accelerated, CUDA-based fast solver with optimized complexity.
Add a description, image, and links to the berlekamp-massey topic page so that developers can more easily learn about it.
To associate your repository with the berlekamp-massey topic, visit your repo's landing page and select "manage topics."