Fast skew-feedback shift-register synthesis

DOI10.1007/s10623-012-9663-9zbMath1331.94047OpenAlexW2064980599MaRDI QIDQ2436582

Martin Bossert, Vladimir Sidorenko

Publication date: 25 February 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9663-9

zbMATH Keywords

decodingReed-Solomon codesGabidulin codesinterleaved codesshift-register synthesismultiple sequencesskew-feedback

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Multiple sequences and series (40B05) Decoding (94B35)

Related Items

Power Decoding of Reed–Solomon Codes Revisited ⋮ On transform-domain error and erasure correction by Gabidulin codes ⋮ Fast skew-feedback shift-register synthesis ⋮ A circulant approach to skew-constacyclic codes ⋮ Decoding interleaved Gabidulin codes using Alekhnovich's algorithm ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Rank-Metric Codes and Their Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast multi-sequence shift-register synthesis with the Euclidean algorithm
• A linear algebraic approach to multisequence shift-register synthesis
• Theory of codes with maximum rank distance
• An algorithm for constructing a minimal partial realization in the multivariable case
• The Berlekamp-Massey algorithm over a finite commutative ring
• Theory of non-commutative polynomials
• Fast decoding of Gabidulin codes
• Fast skew-feedback shift-register synthesis
• Fast multiplication of large numbers
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• 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