Finding Roots of Polynomials Over Finite Fields (2002)
EEE Transactions on Communications
In this letter, we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose–Chaudhuri–Hocquenghem, Reed–Solomon, and some other error-correcting codes. [via]
http://dcn.infos.ru/~petert/papers/rootsIEEE....
polynomial
Related Files
- Multiplicative Complexity of Polynomial Multiplication Over Finite Fields
- Improved Hybrid Algorithm for Finding Roots of Error-Locator Polynomials
- A Method for Fast Computation of the Fourier Transform over a Finite Field
- From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
- FiPy: A Finite Volume PDE Solver Using Python
- Finite Volume Schemes: A Tutorial
Sponsored Links
Free Download Aprilia Manual, Guide, Instructions, available in PDF ebooks format.
Rate this Document
Popular eBooks
- NCURSES Programming HOWTO
- RS/6000 SP: Practical MPI Programming
- Message Passing Toolkit: MPI Programmer's Manual
- Derby Server and Administration Guide - Version 10.3
- Derby Tools and Utilities Guide - Version 10.4
- ActionScript Coding Standards
- Java Platform Migration Guide Version 1.3 to 5.0
- Java Web Start Overview White Paper
- Effective Java: Chapter 3 - Methods Common to All Objects
- High-Performance Java Platform Computing - Chapter 3
ADS
Tag Clouds
3d algorithm analysis application architecture design ebook energy framework guide java javascript kernel linux manual network paper programming python reference security software system theory thesis tutorial typography web service white paper xml
Last Download
- Cooperative Linux
- ISO 81400-4
- CATIA - Multi-Axis Surface Machining 2 (MMG)
- Bayesian Model Averaging: A Tutorial
- Practical CVS Tutorial
BookShelf
- Tutorial on Ontological Engineering
- An Introduction to VBA in Excel
- Discrete Probability Models
- Do Security Toolbars Actually Prevent Phishing Attacks?
- Installing Linux Mandrake 6.1
