<--- Back to Details
First PageDocument Content
Binary arithmetic / Coding theory / Data transmission / Error detection and correction / Cyclic redundancy check / Primitive polynomial / Cyclic code / Parity bit / Checksum / Abstract algebra / Finite fields / Mathematics
Date: 2003-08-28 02:00:00
Binary arithmetic
Coding theory
Data transmission
Error detection and correction
Cyclic redundancy check
Primitive polynomial
Cyclic code
Parity bit
Checksum
Abstract algebra
Finite fields
Mathematics

Add to Reading List

Source URL: www.t10.org

Download Document from Source Website

File Size: 124,35 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