On a fast decoding of Multipoint codes from curves
On a fast decoding of Multipoint codes from curves
复制标题
曲线多点码的快速解码
DOI：
10.1109/isit.2011.6033684
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Shojiro Sakata
中科院分区：
文献类型：
--
作者：
Masaya Fujisawa;Shojiro Sakata
多点编码是一种广泛的代数几何编码，它是由定义曲线上具有多个极点的代数函数衍生而来的。因此，它们比单点码更一般，单点码是一类重要的代数码，因为它们可以通过使用BMS算法有效地解码。本文提出了一种基于代数曲线的多点码快速译码方法。由于代数曲线的代数几何代码本质上与多点代码相同，这意味着几乎所有的代数几何代码都可以有效地解码。
Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions which have multiple poles on their defining curves. Thus, they are more general than one-point codes which are an important class of algebraic codes in the sense that they can be decoded efficiently by using the BMS algorithm. In this paper we present a fast decoding method of multipoint codes from algebraic curves. Since algebraic geometry codes from algebraic curves are essentially the same as multipoint codes, this means that almost all algebraic geometry codes can be decoded efficiently.