On List Decoding of Mahdavifar–Vardy Codes
This paper addresses three problems concerning the list decoding algorithm for Mahdavifar-Vardy (MV) codes. First, the condition of decodability is derived assuming the presence of erasures over the operation channel. Second, we introduce multiplicity into the interpolation step of the algorithm, attempting to obtain a greater decoding radius. However, our results show that the decoding radius is sightly reduced when multiplicity is taken into account, due to properties of linearized polynomials. Finally, to evaluate the error performance of the list decoding algorithm of MV codes, we form a nearest neighbor decoder, and derive its decoder error probability.
Hongmei Xie Zhiyuan Yan Bruce W.Suter
Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, USA Air Force Research Laboratory, Rome, USA
国际会议
2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)
北京
英文
1-4
2011-07-25(万方平台首次上网日期,不代表论文的发表时间)