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

@inproceedings{LeeOSullivan_AnInterpolationAlgorithmSoft_2006, 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}, author = {Lee, Kwankyu and O'Sullivan, M. E.}, citeulike-article-id = {6060441}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/ISIT.2006.261906}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4036325}, day = {26}, doi = {10.1109/ISIT.2006.261906}, journal = {Information Theory, 2006 IEEE International Symposium on}, keywords = {coding, list, soft\_decision}, month = {December}, pages = {2032--2036}, posted-at = {2009-11-03 15:05:14}, priority = {2}, title = {An Interpolation Algorithm using Gr\"{o}bner Bases for Soft-Decision Decoding of Reed-Solomon Codes}, url = {http://dx.doi.org/10.1109/ISIT.2006.261906}, year = {2006} }

TY - CONF ID - LeeOSullivan_AnInterpolationAlgorithmSoft_2006 L3 - citeulike-article-id:6060441 N2 - 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 JF - Information Theory, 2006 IEEE International Symposium on EP - 2036 TI - An Interpolation Algorithm using Gröbner Bases for Soft-Decision Decoding of Reed-Solomon Codes SP - 2032 KW - coding KW - list KW - soft_decision AU - Lee, Kwankyu AU - O'Sullivan, ME PY - 2006/12/26/ UR - http://dx.doi.org/10.1109/ISIT.2006.261906 ER -