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

Version 1.0.0.0 (2.48 KB) by Jaco Versfeld
Implementation of the extended Euclidean algorithm for polynomials over GF(2^m)
4.5
(4)
1.4K Downloads
Updated 26 Mar 2010

View License

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).

Cite As

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

MATLAB Release Compatibility
Created with R2007b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Error Detection and Correction in Help Center and MATLAB Answers
Tags Add Tags

Community Treasure Hunt

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

Start Hunting!

Version Published Release Notes
1.0.0.0