Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. List decoding of algebraic geometric codes
 
Loading...
Thumbnail Image
research article

List decoding of algebraic geometric codes

Shokrollahi, Amin  
•
Wasserman, Hal
1999
IEEE Transactions on Information Theory

We generalize Sudan's (see J. Compl., vol.13, p.180-93, 1997) results for Reed- Solomon codes to the class of algebraic-geometric codes, designing algorithms for list decoding of algebraic geometric codes which can decode beyond the conventional error-correction bound (d-1)/2, d being the minimum distance of the code. Our main algorithm is based on an interpolation scheme and factorization of polynomials over algebraic function fields. For the latter problem we design a polynomial-time algorithm and show that the resulting overall list-decoding algorithm runs in polynomial time under some mild conditions. Several examples are included

  • Details
  • Metrics
Type
research article
DOI
10.1109/18.748993
Author(s)
Shokrollahi, Amin  
•
Wasserman, Hal
Date Issued

1999

Published in
IEEE Transactions on Information Theory
Volume

45

Issue

2

Start page

432

End page

437

Subjects

algoweb_agcodes

•

algoweb_decalgs

Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
ALGO  
Available on Infoscience
January 16, 2007
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/239466
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés