Linear recurrence relations and an extended subresultant algorithm-Reference-Cited by-同舟云学术

Linear recurrence relations and an extended subresultant algorithm

Published: Issue: Volume: Page:232-243
ISSN:
Container-title:Coding Theory and Applications
language:
Short-container-title:

Author:

Fitzpatrick Patrick,Norton Graham

Publisher

Springer-Verlag

Link

http://www.springerlink.com/index/pdf/10.1007/BFb0019862

Reference7 articles.

1. Camion, P., An Iterative Euclidean Algorithm. Proc. Conf. AAECC5, Menorca 1987, to appear in Lect.Notes in Computer Science Series, Springer-Verlag.

2. Lidl, R., Niederreiter, H., Finite Fields, (Encyclopaedia of Mathematics and its Applications, Vol. 20) Addison-Wesley, Reading, Mass. (1987).

3. Loos, R., Generalized Polynomial Remainder Sequences in Computer Algebra, Symbolic and Algebraic Computations (Buchberger, Collins and Loos (eds)) Springer Verlag, Berlin (1983) 115–137.

4. Massey, J.L., Shift Register Sequences and BCH Decoding, IEEE Trans. IT-15 (1969) 122–127.

5. McEliece, R.J., The Theory of Information and Coding (Encyclopaedia of Mathematics and its Applications, Vol. 3) Addison-Wesley, Reading, Mass. (1977).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the key equation;IEEE Transactions on Information Theory;1995

2. The n-dimensional key equation and a decoding application;IEEE Transactions on Information Theory;1994

3. The performance of reference-based M-ary PSK with trellis coded modulation in Rayleigh fading;IEEE Transactions on Vehicular Technology;1992-05

4. Linear recurring sequences and the path weight enumerator of a convolutional code;Electronics Letters;1991-01-03