A Generalized Euclidean Algorithm for Multisequence Shift-Register Synthesis

IEEE Transactions on Information Theory

Volumn 35, Issue 3, 1989, Pages 584-594

  Feng, Gui Liang ^a   Tzeng, Kenneth K ^a  

^a LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC--DECODING; MATHEMATICAL TECHNIQUES--POLYNOMIALS;

GENERALIZED EUCLIDEAN ALGORITHM; GENERALIZED POLYNOMIAL DIVISION ALGORITHM; LINEAR-FEEDBACK SHIFT REGISTER; MULTIPLE SYNDROME SEQUENCES; MULTISEQUENCE SHIFT-REGISTER;

COMPUTERS, DIGITAL;

EID: 0024666843     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.30981     Document Type: Article

References (6)

1. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
2. J. L. Massey, “Shift register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, Jan. 1969.
3. C. R. P. Hartmann and K. K. Tzeng, “Generalizations of the BCH bound,” Inform. Contr., vol. 20, no. 5, pp. 489-498, June 1972.
4. W. H. Mills, “Continued fractions and linear recurrences,” Math. Comput., vol. 29, no. 129, pp. 173-180, Jan. 1975.
5. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “A method for solving key equation for decoding Goppa codes,” Inform. Contr., vol. 27, pp. 87-99, Feb. 1975.
6. G. L. Feng and K. K. Tzeng, “Shift-register synthesis for t sequences,” presented at the IEEE International Symposium on Information Theory, St. Jovite, PQ, Canada, Sept. 1983.