A method for solving key equation for decoding goppa codes

Cited in

(32)

Bounded distance decoding of linear error-correcting codes with Gröbner bases
Two new decoding algorithms for Reed-Solomon codes
Displacement structure for Hankel, Vandermonde, and related (derived) matrices
A library for formalization of linear error-correcting codes
A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
Fast operations on linearized polynomials and their applications in coding theory
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
On decoding hyperbolic codes
The Berlekamp-Massey algorithm revisited
A fast parallel sparse polynomial GCD algorithm
Fast decoding of Gabidulin codes
Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
Toward secure implementation of McEliece decryption
A New Algorithm for Decoding Reed-Solomon Codes
Refined convergents to the associated continued fractions for binary sequences
A linear algebraic approach to multisequence shift-register synthesis
Fast skew-feedback shift-register synthesis
Key-recovery fault injection attack on the classic McEliece KEM
A continuation method for solving symmetric Toeplitz systems
A stabilized superfast solver for indefinite Hankel systems
A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A fast algorithm to compute irreducible and primitive polynomials in finite fields
A Decoding Approach to Reed–Solomon Codes from Their Definition
New techniques for the computation of linear recurrence coefficients
Solving a congruence on a graded algebra by a subresultant sequence and its application
Peterson-Gorenstein-Zierler algorithm for skew RS codes
An improved method for predicting truncated multiple recursive generators with unknown parameters
On lattice-based algebraic feedback shift registers synthesis for multisequences
Power decoding Reed-Solomon codes up to the Johnson radius
A relationship between the Berlekamp-Massey and the euclidean algorithms for linear feedback shift register synthesis

This page was built for publication: A method for solving key equation for decoding goppa codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045944)