• DocumentCode
    2947853
  • Title

    An Interpolation Algorithm using Gröbner Bases for Soft-Decision Decoding of Reed-Solomon Codes

  • Author

    Lee, Kwankyu ; O´Sullivan, Michael E.

  • Author_Institution
    Dept. of Math. & Stat., San Diego State Univ., CA
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    2032
  • Lastpage
    2036
  • Abstract
    A central problem of algebraic soft-decision decoding of Reed-Solomon codes is to find the minimal polynomial of the ideal of interpolating polynomials with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Grobner bases of modules
  • Keywords
    Reed-Solomon codes; algebraic codes; decoding; interpolation; Grobner bases; Reed-Solomon codes; algebraic decoding; interpolation algorithm; soft-decision decoding; Decoding; Equations; Interpolation; Iterative algorithms; Kernel; Lagrangian functions; Mathematics; Polynomials; Reed-Solomon codes; Statistics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2006 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    1-4244-0505-X
  • Electronic_ISBN
    1-4244-0504-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2006.261906
  • Filename
    4036325
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2947853