Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Database Workbench Pro 5.4.6
Extensibility Studio 3.0
Bytescout Spreadsheet SDK 3.0.0.1699
Magento 2 Admin Mobile App 1.0
Data Compare for MySQL 5.3
ODBC Driver for Zoho CRM 1.3
ODBC Driver for SugarCRM 1.3
Bytescout PDF To HTML SDK 9.0.0.3079
Azizi search engine script PHP 4.1.10
TaxiSoftr - Taxi Booking & Dispatch Software 1.0
VisualNEO for Windows 18.08.31
AnyMap JS Maps 8.4.0
ODBC Driver for MailChimp 1.3
OrgChart JS 3.0.7
AnyStock Stock and Financial JS Charts 8.4.0
Top Code
Stepping stone algorithum for solving the transhipment problem
K-medoids 1.0
Java-2-Pseudo 1.0
Simplified Gradient Descent Optimization 1.0
SudokuUI 1.0
dbForge SQL Complete 4.8
Borland Delphi Language Grammar 5
Logic Game 1.0
MLM Script 1.0
ASCII Graphics BlackJack 1.1
Chess with Greedy Edi 1.1
MLM Balster 4.0
IP.Board recent topics 1.2
War Game (Version 2)
phpCounter 0.0.1
Top Rated
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Advanced MLM Software 1.2
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
PHP Point of sale 10.0
Travel Portal Script 9.29
Excel Add-in for Bigcommerce 1.6
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
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: 70
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: 70



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



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

Marcelo Augusto Costa Fernandes
DCA - CT - UFRN



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: http://en.wikipedia.org/wiki/Viterbi_algorithm

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