Fast multi-sequence shift-register synthesis with the Euclidean algorithm
From MaRDI portal
Publication:660086
DOI10.3934/AMC.2011.5.667zbMath1251.94017OpenAlexW2085440372MaRDI QIDQ660086
Antonia Wachter, Alexander Zeh
Publication date: 25 January 2012
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2011.5.667
fast algorithmsdivide and conquerinterleaved Reed-Solomon codesextended Euclidean algorithmmultisequence shift-register synthesis
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclic codes (94B15) Decoding (94B35)
Related Items (3)
Fast skew-feedback shift-register synthesis ⋮ Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
This page was built for publication: Fast multi-sequence shift-register synthesis with the Euclidean algorithm
