Pages that link to "Item:Q4045944"

The following pages link to A method for solving key equation for decoding goppa codes (Q4045944):

Displaying 29 items.

• On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field (Q412213) (← links)
• Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
• A linear algebraic approach to multisequence shift-register synthesis (Q764390) (← links)
• Displacement structure for Hankel, Vandermonde, and related (derived) matrices (Q803726) (← links)
• A stabilized superfast solver for indefinite Hankel systems (Q1124777) (← links)
• Solving a congruence on a graded algebra by a subresultant sequence and its application (Q1209629) (← links)
• Two new decoding algorithms for Reed-Solomon codes (Q1311609) (← links)
• Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
• On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
• Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
• Fast decoding of Gabidulin codes (Q1934220) (← links)
• New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
• A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
• A library for formalization of linear error-correcting codes (Q2209551) (← links)
• Toward secure implementation of McEliece decryption (Q2360179) (← links)
• Fast skew-feedback shift-register synthesis (Q2436582) (← links)
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
• Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability (Q2448071) (← links)
• Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials (Q2473633) (← links)
• The Berlekamp-Massey algorithm revisited (Q2502174) (← links)
• An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
• A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
• Refined convergents to the associated continued fractions for binary sequences (Q4308502) (← links)
• A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377) (← links)
• A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
• A relationship between the Berlekamp-Massey and the euclidean algorithms for linear feedback shift register synthesis (Q4711679) (← links)
• ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS (Q5089874) (← links)
• Peterson–Gorenstein–Zierler algorithm for skew RS codes (Q5206286) (← links)
• A continuation method for solving symmetric Toeplitz systems (Q6191483) (← links)