An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings

The construction of shortest feedback shift registers for a finite sequence S 1 , … , S N is considered over finite chain rings, such as Z p r . A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S 1 , … , S N , thus solv...

Full description

Saved in:

Bibliographic Details
Published in:	Designs, codes, and cryptography Vol. 83; no. 2; pp. 283 - 305
Main Authors:	Kuijper, M., Pinto, R.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2017 Springer Nature B.V
Subjects:	Circuits Coding and Information Theory Computer Science Cryptology Data Structures and Information Theory Discrete Mathematics in Computer Science Feedback Information and Communication Iterative algorithms Parameterization Registers Shift registers Polynomial modules Minimal basis Parametrization Sequences 16P10 Shift registers Iterative algorithms 94A55
ISSN:	0925-1022, 1573-7586
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!