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