Solving a congruence on a graded algebra by a subresultant sequence and its application

DOI10.1016/0747-7171(92)90020-5zbMath0939.94570OpenAlexW1984112061MaRDI QIDQ1209629

Ba-Zhong Shen

Publication date: 16 May 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0747-7171(92)90020-5

zbMATH Keywords

Hermitian curvegeometric Goppa codes

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Graded rings (13A02) Decoding (94B35)

Related Items

Double Sylvester sums for subresultants and multi-Schur functions.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extension of the Berlekamp-Massey algorithm to N dimensions
• New constructive methods in classical ideal theory
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• A note on Hermitian codes over GF(q/sup 2/)
• Decoding geometric Goppa codes using an extra place
• A method for solving key equation for decoding goppa codes
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants