Index-> contents reference index search external Previous Next Home home-> links software journals packages publications resume pub_abstract white_paper ssh_key fedora_package bikelist rock_climb picture pub_abstract-> newton_step tmb rkhs_bayes dismod_pde sskm l1_rks implicit_ad ckbs bayes_inverse mcmc_smooth semiblind neuron ConsumeO2 StochasticNonlinear SmoothVariance randompar markov sammii relative gps smoother prolate update nltrack network burg semi gamma match nsmooth error line_search error Headings-> Abstract

Software techniques for error correcting codes

Abstract
The theory of error correcting codes is well developed, but that theory involves calculations in fields other than the ones which most people are used to. In order to do error correction it is necessary to do arithmetic in extension fields of the integers mod 2. This is a review of some techniques that are useful in performing the necessary calculation sin these fields. Only a working knowledge of polynomial rings will be assumed, and a detailed explanation of terms from abstract algebra will be given. For a review of polynomial rings see Chapter 3, Section 9, of "Topics in Algebra" by I.N. Herstein (1964).  citation
Input File: error.omh