An algorithm is given for the k-error linear complexity of sequences over GF(p(m)) with period p(n), p a prime. The algorithm is derived by the generalized games-chan algorithm for the linear complexity of sequences o...
详细信息
An algorithm is given for the k-error linear complexity of sequences over GF(p(m)) with period p(n), p a prime. The algorithm is derived by the generalized games-chan algorithm for the linear complexity of sequences over GF(p(m)) with period p(n) and by using the modified cost different from that used in the Stamp-Martin algorithm for sequences over GF(2) with period 2(n). A method is also given for computing an error vector which gives the k-error linear complexity. (C) 1999 Academic Press.
暂无评论