In this paper,we discuss the fast evaluation algorithm of polynomials showed by H.T. Kung,and show some lower bounds of the linear complexity for some orthogonal linear transformations
文摘In this paper,we discuss the fast evaluation algorithm of polynomials showed by H.T. Kung,and show some lower bounds of the linear complexity for some orthogonal linear transformations