Polynomial Root Computation with a Stored Table,

Abstract

A method of finding the roots of a polynomial over a finite field is presented. The proposed method uses a small table to help reduce the computational complexity. This method is applicable to algebraic decoding techniques, particularly toward the computation of error locations. The stored table approach is attractive due to its high speed. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1971
Accession Number
AD0726915

Entities

People

  • A. Moy
  • Robert Tienwen Chien

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Coding
  • Computational Complexity
  • Computations
  • Decoding
  • Mathematical Analysis
  • Mathematics
  • Notation
  • Polynomials

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Operations Research