Extended Euclidean Algorithm for polynomials over GF(2^m)

Versione 1.0.0.0 (2,48 KB) da Jaco Versfeld
Implementation of the extended Euclidean algorithm for polynomials over GF(2^m)
4.5
(4)
1,5K download
Aggiornato 26 mar 2010

Visualizza la licenza

Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd = u(x)a(x) + v(x)b(x).

Cita come

Jaco Versfeld (2025). Extended Euclidean Algorithm for polynomials over GF(2^m) (https://it.mathworks.com/matlabcentral/fileexchange/27091-extended-euclidean-algorithm-for-polynomials-over-gf-2-m), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2007b
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Error Detection and Correction in Help Center e MATLAB Answers
Tag Aggiungi tag

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.0.0.0