Conference ProceedingsOPEN ACCESS

Proof of massey’s conjectured algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 330 LNCS 345-349
DOI: 10.1007/3-540-45961-8_32
16Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Massey’s conjectured algorithm for multi-sequence shift register synthesis is proved, and its suitability for the minimal realization of any linear system is also verified.

Cite

CITATION STYLE

APA

Ding, C. (1988). Proof of massey’s conjectured algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 330 LNCS, pp. 345–349). Springer Verlag. https://doi.org/10.1007/3-540-45961-8_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free