Decoding Ag-codes and Let W Be a Vector Having Acknowledgments Decoding Ag-codes

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Improved decoding of Reed-Solomon and algebraic-geometry codes

  1999cited by this paper
• Factorization of multivariate polynomials over finite fields

  1999cited by this paper
• Decoding algebraic-geometric codes beyond the error-correction bound

  1998cited by this paper
• Decoding of Reed Solomon Codes beyond the Error-Correction Bound

  1997cited by this paper
• Bounded distance+1 soft-decision Reed-Solomon decoding

  1996cited by this paper
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound

  1995cited by this paper
• On the decoding of algebraic-geometric codes

  1995cited by this paper
• A course in computational algebraic number theory

  1993cited by this paper
• Reconstructing algebraic functions from mixed data

  1992cited by this paper
• Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve

  1991cited by this paper
• Construction and decoding of a class of algebraic geometry codes

  1989cited by this paper
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number

  1986cited by this paper
• Factoring Polynomials Over Algebraic Number Fields

  1985cited by this paper
• Factoring Multivariate Polynomials over Algebraic Number Fields

  1984cited by this paper
• Codes on Algebraic Curves

  1981cited by this paper
• private communication

  1969cited by this paper

• No citing papers are available for this paper.