A linear algebraic approach to multisequence shift-register synthesis
From MaRDI portal
Publication:764390
DOI10.1134/S0032946011020062zbMath1251.94016MaRDI QIDQ764390
Georg Schmidt, Vladimir Sidorenko
Publication date: 13 March 2012
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items
Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) ⋮ Fast skew-feedback shift-register synthesis ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Power decoding Reed-Solomon codes up to the Johnson radius
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for constructing a minimal partial realization in the multivariable case
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Reed-solomon codes for correcting phased error bursts
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- A generalized Euclidean algorithm for multisequence shift-register synthesis
- A method for solving key equation for decoding goppa codes
- Continued Fractions and Linear Recurrences
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
- Linearized Shift-Register Synthesis
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
- Shift-register synthesis and BCH decoding
- Coding and Cryptography
This page was built for publication: A linear algebraic approach to multisequence shift-register synthesis
