本文仅就满足齐次线性递推关系序列，给出它一般项求法。
This Paper gives Only a method to find the general term u_n of a Sequences Which Satisfies homogeneous Linear recurrence relations.
主要讨论了一点代数几何码的伴随式阵列及其上的线性递推关系。
The syndrome arrays are discussed in detail which are employed in decoding of a class of algebraic geometric codes and the linear recurring relations on that.
对若当标准形及所使用的可逆矩阵的计算加以简化，并借助若当标准形给出线性递推关系式求解的一般方法。
By using Frobenius matrix, this paper presents the common solution in another form to linear recurrence formula with constant coefficients.
应用推荐