Linearized Shift-Register Synthesis
From MaRDI portal
Publication:5272379
DOI10.1109/TIT.2011.2162173zbMath1365.94390OpenAlexW2160997819MaRDI QIDQ5272379
Gerd Richter, Vladimir Sidorenko, Martin Bossert
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2011.2162173
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Other types of codes (94B60) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Rank subcodes in multicomponent network coding ⋮ On transform-domain error and erasure correction by Gabidulin codes ⋮ Fast decoding of Gabidulin codes ⋮ Fast skew-feedback shift-register synthesis ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ On decoding additive generalized twisted Gabidulin codes ⋮ A linear algebraic approach to multisequence shift-register synthesis ⋮ Encoding and decoding of several optimal rank metric codes ⋮ Rank-Metric Codes and Their Applications
This page was built for publication: Linearized Shift-Register Synthesis