Fast multi-sequence shift-register synthesis with the Euclidean algorithm (Q660086)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6000192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast multi-sequence shift-register synthesis with the Euclidean algorithm |
scientific article; zbMATH DE number 6000192 |
Statements
Fast multi-sequence shift-register synthesis with the Euclidean algorithm (English)
0 references
25 January 2012
0 references
divide and conquer
0 references
extended Euclidean algorithm
0 references
interleaved Reed-Solomon codes
0 references
fast algorithms
0 references
multisequence shift-register synthesis
0 references
0.8910142183303833
0 references
0.8728078603744507
0 references
0.8334571719169617
0 references
0.8048761487007141
0 references
