The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Generalised Multi-sequence Shift-Register Synthesis using Module Minimisation
[article]
2013
arXiv
pre-print
We show how to solve a generalised version of the Multi-sequence Linear Feedback Shift-Register (MLFSR) problem using minimisation of free modules over F[x]. We show how two existing algorithms for minimising such modules run particularly fast on these instances. Furthermore, we show how one of them can be made even faster for our use. With our modeling of the problem, classical algebraic results tremendously simplify arguing about the algorithms. For the non-generalised MLFSR, these algorithms
arXiv:1301.6529v4
fatcat:lxggipsucfbptdi4pgqcxlfini