notes7.dvi

First Page		Document Content
Date: 2012-11-16 13:31:42 Mathematics Finite fields BCH code Cyclic code Reed–Solomon error correction Polynomial code Primitive polynomial Vandermonde matrix Parity-check matrix Coding theory Algebra Error detection and correction		notes7.dvi Add to Reading List Source URL: www.stanford.edu Download Document from Source Website File Size: 322,62 KB Share Document on Facebook

	The modpn Library: Bringing Fast Polynomial Arithmetic into Maple Xin Li Marc Moreno Maza Raqeeb Rasheed DocID: 1qv76 - View Document
	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
	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
	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