Pages that link to "Item:Q5281273"
From MaRDI portal
The following pages link to Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis (Q5281273):
Displaying 15 items.
- A lattice-based minimal partial realization algorithm for matrix sequences of varying length (Q662164) (← links)
- A linear algebraic approach to multisequence shift-register synthesis (Q764390) (← links)
- Power error locating pairs (Q782853) (← links)
- Improved power decoding of interleaved one-point Hermitian codes (Q1727371) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension (Q2436580) (← links)
- Fast skew-feedback shift-register synthesis (Q2436582) (← links)
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability (Q2448071) (← links)
- Power Decoding of Reed–Solomon Codes Revisited (Q3460479) (← links)
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm (Q3540917) (← links)
- (Q4552218) (← links)
- Distinguishing and recovering generalized linearized Reed-Solomon codes (Q6132742) (← links)
- Polynomial linear system solving with random errors. New bounds and early termination technique (Q6666533) (← links)