• 통합자연과학논문집
• /
• 제7권4호
• /
• pp.283-285
• /
• 2014

We investigate irreducibility of the quadrinomial $F_m(x)=x^{2m}-x^{m+1}-x^{m-1}-1$ where m is an even integer ${\geq}2$ using only basic techniques that can be often used in many classes of polynomials.

• 대한수학회보
• /
• 제55권5호
• /
• pp.1491-1501
• /
• 2018

Polynomials with all the coefficients in {0, 1} and constant term 1 are called Newman polynomials, whereas polynomials with all the coefficients in {-1, 1} are called Littlewood polynomials. By exploiting an algorithm developed earlier, we determine the set of Littlewood polynomials of degree at most 12 which divide Newman polynomials. Moreover, we show that every Newman quadrinomial $X^a+X^b+X^c+1$, 15 > a > b > c > 0, has a Littlewood multiple of smallest possible degree which can be as large as 32765.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.498-503
• /
• 2009

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.