• DocumentCode
    1230253
  • Title

    On a decoding algorithm for codes on maximal curves

  • Author

    Pellikaan, Ruud

  • Author_Institution
    Dept. of Math. & Comput. Sci., Tech. Univ. of Eindhoven, Netherlands
  • Volume
    35
  • Issue
    6
  • fYear
    1989
  • fDate
    11/1/1989 12:00:00 AM
  • Firstpage
    1228
  • Lastpage
    1232
  • Abstract
    A decoding algorithm for algebraic geometric codes that was given by A.N. Skorobogatov and S.G. Vladut (preprint, Inst. Problems of Information Transmission, 1988) is considered. The author gives a modified algorithm, with improved performance, which he obtains by applying the above algorithm a number of times in parallel. He proves the existence of the decoding algorithm on maximal curves by showing the existence of certain divisors. However, he has so far been unable to give an efficient procedure of finding these divisors
  • Keywords
    codes; decoding; algebraic geometric codes; decoding algorithm; divisors; maximal curves; Algorithm design and analysis; Decoding; Galois fields; Mathematics; Parity check codes; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.45279
  • Filename
    45279
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1230253