Code Directory
 Visual Basic & VB.NET
New Code
Database Workbench Pro 5.4.0
ByteScout Text Recognition SDK
Equipment Rental Script 1.0
Aliexpress Clone- Ec21 Script 1
Agriya Event Booking Solution v2.0b5
Key Transformation 8.1133
IP2Location Geolocation Database 2018
Hotel Restaurant Reviews and Feedback Script 1.0.2
Luxand FaceSDK 6.4
wolfSSL 3.13.0
PHP Survey 1.0
dbForge Studio for MySQL 7.3
Vimeo Script, Dailymotion Clone 1.0.2
SQLi 8
Directory Script- PHP Business Directory Script 1.0.2
Top Code
NES Rom Maker 1.0
Luxand FaceSDK 6.4
Huffman Coding and Decoding for Text Compression 1.1
Magento 2 Multi Vendor Marketplace Module by Apptha 1.0
Hotel Management System Restaurant Version 5.25
HIOX GuestBook 4.0
Ticket Booking System 1.0
Hotel Management CRM 1.0
Olex2 2
Hotel Management - Full Board Version 6.55
SuperGeek Free Document OCR 2.5.6
MyDay Web Diary 0.1a3
Easy PCB Design Software in Java 1.0
Jango Clone Script 1.0
Top Rated
Indiegogo Clone 3.0
PHP Image Resize Script 1.0
Jango Clone Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
Readymade MLM Products 2.01
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Extended Euclidean Algorithm for polynomials over GF(2^m) 1.0
File ID: 77861

Extended Euclidean Algorithm for polynomials over GF(2^m) 1.0
Download Extended Euclidean Algorithm for polynomials over GF(2^m) 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 68
User Rating:3 Stars  (2 ratings)
Submit Rating:
Extended Euclidean Algorithm for polynomials over GF(2^m) 1.0 Description
Description: 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).

License: Freeware

Related: extended, euclidean, Algorithm, polynomials, gf2m, Scripts

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 68

More Similar Code

It is a bit surprising that the communications toolbox provides functionality for elements over gf(2), but it does not provide functionality for finding the null space of a matrix over the Galois field. These two files are simple modifications of the standard files "null.m" and "rref.m". The modification finds the null space of a matrix over gf(2).

This code converts a Galois Field array created using GF(2^m) for a given primitive polynomial into the 'exponential' notation, which you can use with gfrepcov() to binary if you wish.

Uses the gf2dec() function internally.

The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm....

findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).
An independent set of a graph is a subset of vertices in which no two vertices are
adjacent. Given a set of vertices, the maximum independent set...

A simple and fast algorithm for generating doubly-stochasstic matrices.
(matrices, where the sum of each column and each row is exactly 1).
Each matrix is chosen uniformly from the space of all NxN doubly-stochasstic

Multilayer Perceptron Neural Network Model and Backpropagation Algorithm for Simulink.
Multilayer Perceptron Neural Network Model and Backpropagation Algorithm for Simulink.

Marcelo Augusto Costa Fernandes

This function contains the well known greedy algorithm for solving Set Cover problem (ChvdodAtal, 1979), with two small modifications:
* In case of more than one possible choice at a certain step, the biggest set is chosen;
* Once the...

Vibterbi algorithm for HMM inference
Viterbi algorithm based on the Python code found at:

Also included is an example based on the one from the Wikipedia page.

The code is...

3D reconstruction algorithm for electron cryo-microscopy
Traditional single particle reconstruction methods use either the Fourier or the delta function basis to represent the particle density map. We propose a more flexible algorithm that...

The Radial Basis Function (RBF) with LMS algorithm for Simulink.
The Radial Basis Function (RBF)
Batch-mode training
Fixed centers selected at random
The Gaussian basis functions
Computing the output weights with LMS...

User Review for Extended Euclidean Algorithm for polynomials over GF(2^m)
- required fields

Please enter text on the image