A method for solving key equation for decoding goppa codes
From MaRDI portal
Publication:4045944
DOI10.1016/S0019-9958(75)90090-XzbMath0293.94007OpenAlexW2016833807MaRDI QIDQ4045944
Yasuo Sugiyama, Shigeichi Hirasawa, Masao Kasahara, Toshihiko Namekawa
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(75)90090-x
Related Items
Toward secure implementation of McEliece decryption, A New Algorithm for Decoding Reed-Solomon Codes, Fast operations on linearized polynomials and their applications in coding theory, A Decoding Approach to Reed–Solomon Codes from Their Definition, A stabilized superfast solver for indefinite Hankel systems, ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS, Refined convergents to the associated continued fractions for binary sequences, Fast decoding of Gabidulin codes, On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field, Key-recovery fault injection attack on the classic McEliece KEM, A fast algorithm to compute irreducible and primitive polynomials in finite fields, On lattice-based algebraic feedback shift registers synthesis for multisequences, A continuation method for solving symmetric Toeplitz systems, Fast skew-feedback shift-register synthesis, A library for formalization of linear error-correcting codes, An improved method for predicting truncated multiple recursive generators with unknown parameters, 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, New techniques for the computation of linear recurrence coefficients, Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials, A fast parallel sparse polynomial GCD algorithm, Solving a congruence on a graded algebra by a subresultant sequence and its application, The Berlekamp-Massey algorithm revisited, Power decoding Reed-Solomon codes up to the Johnson radius, Bounded distance decoding of linear error-correcting codes with Gröbner bases, Peterson–Gorenstein–Zierler algorithm for skew RS codes, A relationship between the Berlekamp-Massey and the euclidean algorithms for linear feedback shift register synthesis, A linear algebraic approach to multisequence shift-register synthesis, Two new decoding algorithms for Reed-Solomon codes, Displacement structure for Hankel, Vandermonde, and related (derived) matrices
