<--- Back to Details
First PageDocument Content
Abstract algebra / Maximum length sequence / Hadamard matrix / Primitive polynomial / Hadamard transform / Irreducible polynomial / Convolution / Matrix / COMPASS/Sample Code / Mathematics / Algebra / Polynomials
Date: 2007-02-03 16:20:13
Abstract algebra
Maximum length sequence
Hadamard matrix
Primitive polynomial
Hadamard transform
Irreducible polynomial
Convolution
Matrix
COMPASS/Sample Code
Mathematics
Algebra
Polynomials

Add to Reading List

Source URL: jenshee.dk

Download Document from Source Website

File Size: 101,75 KB

Share Document on Facebook

Similar Documents

Mathematics / Algebra / Polynomials / Computer algebra / Equations / Resultant / RegularChains / System of polynomial equations / Euclidean algorithm / Polynomial / Primitive part and content / Regular chain

The modpn Library: Bringing Fast Polynomial Arithmetic into Maple Xin Li Marc Moreno Maza Raqeeb Rasheed

DocID: 1qv76 - View Document

Algebra / Mathematics / Abstract algebra / Polynomials / Computer algebra / Ring theory / Commutative algebra / Polynomial / Primitive part and content / Euclidean domain / Ring / Remainder

POLYDIV: Enhanced Polynomial Division Francis J. Wright School of Mathematical Sciences Queen Mary and Westfield College University of London Mile End Road, London E1 4NS, UK.

DocID: 1pVMv - View Document

Mathematics / Algebra / Polynomials / Computer algebra / Resultant / Polynomial / Factorization / Primitive part and content / Greatest common divisor / Irreducible polynomial / Sylvester matrix / Polynomial greatest common divisor

Improved algorithms for solving bivariate systems via Rational Univariate Representations Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff To cite this version:

DocID: 1lVp4 - View Document

Polynomials / Finite fields / Coding theory / Field theory / Error detection and correction / Primitive polynomial / Cyclic code / Irreducible polynomial / Polynomial / Abstract algebra / Algebra / Mathematics

The Mathematics of Coding: Information, Compression, Error Correction, and Finite Fields

DocID: 1gbjE - View Document

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α ∈ K. The minimal polynomial Let K be a number field and let α ∈

DocID: 1bnyB - View Document