Shift-register synthesis (modulo m) (1985)
Cached
Download Links
- [akpublic.research.att.com]
- [research.att.com]
- [www.research.att.com]
- DBLP
Other Repositories/Bibliography
by
J. A. Reeds
,
N. J. A. Sloane
| Venue: | SIAM J. Computing |
| Citations: | 13 - 0 self |
BibTeX
@ARTICLE{Reeds85shift-registersynthesis,
author = {J. A. Reeds and N. J. A. Sloane},
title = {Shift-register synthesis (modulo m)},
journal = {SIAM J. Computing},
year = {1985},
volume = {14},
pages = {505--513}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback shift register) that can generate the sequence. In this paper we extend the algorithm to the case when the elements of the sequence are integers modulo m, where m is an arbitrary integer with known prime decomposition.
