12 results

convert fg array to decimal numbers

This code converts a Galois Field array created using GF(2^m) for a given primitive polynomial into a decimal array that can be used within typical .m file

Convert GF array into exponential notation (a^3, etc)

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

Finds the modular inverse over finite (Galois) field.

MULINV(X,P) is a function that finds the modular inverse of vector X over finite (Galois) field of order P, i.e. if Y = MULINV(X,P)then (X*Y) mod P = 1 or Y = X^(-1) over field of order P.The input

everything about RS generation and generation polynomial and encoding and syndrome

Library of Linear Algebra functions over Finite Fields

Encrypt/Decrypt a plaintext message using AES GCM.

Galois Counter Mode (GCM) Block Cipher using AES-128,192,256 based on the key length. Implimentation is based on NIST Special Publication 800-38D. Inputs: secretKey - AES secret key, hexidecimal

A simple MATLAB based network coding simulator.

Network Coding simulations are performed on a simple butterfly network. Parameters such as link packet loss rate, network code rate, generation size, Galois field size and number of transmitted

This is a toolbox providing simple operations (+,-,*,/,.*,./,inv) for finite field.

Follows textbook practice questions in MATLAB, showing 'manual' decoding.

See "Digital Communications" by Sklar as the reference for this. These MATLAB scripts answer questions 8.3 - 8.7, but using similar methods you might by hand. Includes generating Galois Field

simple routine to find the null space of a matrix over gf (2)

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

Multivariate Polynomial Signature with a prime p is product of odd prime number q multiplied with a power x of two and then plus one.

prime Galois field GF(p) and two multivariate polynomials P and Q, if P is equal to Q modulo p‑1, then g to the power of P is equal to g to the power of Q modulo p. MPPK/DS is designed to make secret the

Demonstrates the RiBM algorithm used for "universal" Reed-Solomon decoding.