On the Efficient Decoding of Algebraic-Geometric Codes

This publication has 26 references indexed in Scilit:

• Fast decoding of codes from algebraic plane curves
  IEEE Transactions on Information Theory, 1992
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
  IEEE Transactions on Information Theory, 1991
• Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
  IEEE Transactions on Information Theory, 1991
• The hardness of decoding linear codes with preprocessing
  IEEE Transactions on Information Theory, 1990
• Algebraic Geometric Codes
  Published by Springer Nature ,1990
• Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e>e/sub BCH/
  IEEE Transactions on Information Theory, 1990
• Generalized Reed - Solomon codes from algebraic geometry
  IEEE Transactions on Information Theory, 1987
• On the minimum distance of cyclic codes
  IEEE Transactions on Information Theory, 1986
• Codes and information
  Russian Mathematical Surveys, 1984
• On the inherent intractability of certain coding problems (Corresp.)
  IEEE Transactions on Information Theory, 1978