单点AG码的Lee-O 'Sullivan列表译码的推广
Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes
摘要:
在比Beelen和Brander弱的假设下,将Lee和O 'Sullivan基于格罗布纳基提出的Hermitian码的列表译码算法推广到一般的单点AG码.我们的推广使我们能够应用快速算法来计算一个由Lee和O 'Sullivan提出的模的格罗布纳基,这在Lax的另一个推广中是不可能的。
英文摘要:
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. Our generalization enables us to apply the fast algorithm to compute a Gröbner basis of a module proposed by Lee and O'Sullivan, which was not possible in another generalization by Lax.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。