<--- Back to Details
First PageDocument Content
Polynomials / Finite fields / Coding theory / Field theory / Error detection and correction / Primitive polynomial / Cyclic code / Irreducible polynomial / Polynomial / Abstract algebra / Algebra / Mathematics
Date: 2007-10-17 12:13:25
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

Add to Reading List

Source URL: www.math.umn.edu

Download Document from Source Website

File Size: 1,53 MB

Share Document on Facebook

Similar Documents

How to Calculate P(O) Calculating P(O) Forward Algorithm Backward Algorithm

How to Calculate P(O) Calculating P(O) Forward Algorithm Backward Algorithm

DocID: 1rsaS - View Document

Daniels_meeting_cover.eps

Daniels_meeting_cover.eps

DocID: 1rphC - View Document

1  Underdesigned and Opportunistic Computing in Presence of Hardware Variability Puneet Gupta1 , Member, IEEE, Yuvraj Agarwal2 , Member, IEEE, Lara Dolecek1 , Member, IEEE, Nikil Dutt6 , Fellow, IEEE, Rajesh K. Gupta2 ,

1 Underdesigned and Opportunistic Computing in Presence of Hardware Variability Puneet Gupta1 , Member, IEEE, Yuvraj Agarwal2 , Member, IEEE, Lara Dolecek1 , Member, IEEE, Nikil Dutt6 , Fellow, IEEE, Rajesh K. Gupta2 ,

DocID: 1roDZ - View Document

PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam

PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam

DocID: 1rlYO - View Document