Berlekampův algoritmus
Loading...
Downloads
5
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská - Technická univerzita Ostrava
Location
Signature
Abstract
This thesis describes Berlekamp's algorithm, which factors polynomials over finite fields into ireducible ones. Finite field has many interesting properties, either in common with integers, real or complex numbers, andr many other unique ones - that in contrast with infinite fields allow existence \& correctness of Berlekamp's algorithm.
Description
Subject(s)
Berlekamp's algorithm, factorization, polynomial, finite field