Berlekamp-Massey 알고리즘을 이용한 최소다항식 구하기

Abstract

In this thesis, the author introduce the linear recurring sequence and characteristic polynomial, and study the generating function and reciprocal polynomial. Also we propose method of finding the characteristic polynomial of a sequence and minimal polynomials of a linear recurring sequence for the characteristic polynomial in the set of all polynomials with coefficients in the finite field with characteristic q. Moreover the author introduce the Berlekamp-Massey algorithm(BMA) of finding the minimal polynomial after finite steps at fixed time we know an upper bound about degree of a minimal polynomial and then propose the improved BMA and find the minimal polynomial using this algorithm.