.png){kind=icon}
返回
Reduced Complexity Interpolation for List Decoding Hermitian Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/T-WC.2008.070615.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
List decoding Hermitian codes using the Guruswami-Sudan (GS) algorithm can correct errors beyond half the designed minimum distance. It consists of two processes: interpolation and factorisation. By first defining a Hermitian curve, these processes can be implemented with an iterative polynomial construction algorithm and a recursive coefficient search algorithm respectively. To improve the efficiency of list decoding Hermitian codes, this paper presents two contributions to reduce the interpolation complexity. First, in order to simplify the calculation of a polynomial's zero condition during the iterative interpolation, we propose an algorithm to determine the corresponding coefficients between the pole basis monomials and zero basis functions of a Hermitian curve. Second, we propose a modified complexity reducing interpolation algorithm. This scheme identifies any unnecessary polynomials during iterations and eliminates them to improve the interpolation efficiency. Due to the above complexity reducing modifications, list decoding long Hermitian codes with higher interpolation multiplicity becomes feasible. This paper shows list decoding algorithm can achieve significant coding gain over the conventional unique decoding algorithm.
Keyword:
List decoding
hermitian codes
decoding efficiency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
An evaluation of N-phenyl-1-naphthylamine as a probe of membrane energy state in Escherichia coli
PREAI
分享收藏分享收藏
查看更多内容