List Decoding of Hermitian Codes using Groebner Bases Export

@article{Lee-OSullivan:ARXIV2006b, abstract = {List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm seems comparable to previously known algorithms achieving the same task, and the algorithm is better suited for hardware implementation.}, archivePrefix = {arXiv}, author = {Lee, Kwankyu and O'Sullivan, Michael E.}, citeulike-article-id = {3722059}, citeulike-linkout-0 = {http://arxiv.org/abs/cs/0610132}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs/0610132}, day = {23}, eprint = {cs/0610132}, keywords = {coding, hermitian, list}, month = {Oct}, posted-at = {2009-11-03 14:34:40}, priority = {2}, title = {List Decoding of Hermitian Codes using Groebner Bases}, url = {http://arxiv.org/abs/cs/0610132}, year = {2006} }

TY - JOUR ID - Lee-OSullivan:ARXIV2006b L3 - citeulike-article-id:3722059 N2 - List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm seems comparable to previously known algorithms achieving the same task, and the algorithm is better suited for hardware implementation. TI - List Decoding of Hermitian Codes using Groebner Bases KW - coding KW - hermitian KW - list AU - Lee, Kwankyu AU - O'Sullivan, Michael PY - 2006/Oct/23/ UR - http://arxiv.org/abs/cs/0610132 ER -