An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings |
scientific article |
Statements
An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (English)
0 references
13 April 2017
0 references
iterative algorithms
0 references
minimal basis
0 references
parametrization
0 references
polynomial modules
0 references
sequences
0 references
shift registers
0 references
0 references
0 references
0 references
0.7462131977081299
0 references
0.7421897649765015
0 references
0.7371804714202881
0 references
