arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1008.4474cs.ITmath.COmath.IT
收藏

梯度下降译码的代数观点

An Algebraic View to Gradient Descent Decoding

M. Borges Quintana, M. A. Borges Trenard, I. Marquez-Corbella, E. Martinez-Moro

摘要:

有两个梯度下降解码过程的二进制码提出独立的Liebler和Ashikhmin和Barg。Liebler在他的论文中提到,这两种算法具有相同的哲学,但实际上它们是相当不同的。本通信的目的是表明这两种算法都可以看作是理解简化过程中代数幺半群结构相关代码的两种方法。用于说明这一点的主要工具是与线性码相关联的幺半群的Gröbner表示。

英文摘要:

There are two gradient descent decoding procedures for binary codes proposed independently by Liebler and by Ashikhmin and Barg. Liebler in his paper mentions that both algorithms have the same philosophy but in fact they are rather different. The purpose of this communication is to show that both algorithms can be seen as two ways of understanding the reduction process algebraic monoid structure related to the code. The main tool used for showing this is the Gröbner representation of the monoid associated to the linear code.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑