An Upper and a Lower Bound on the Probability of an Undetected Error for Binary Expansions of Generalized Reed-Solomon Codes

摘要：

By utilizing certain characteristic structure of the Hamming weight distribution of maximum distance separable codes, we can get weight enumerators to compute an upper and a lower bound on the probability of an undetected error for binary expansions of generalized Reed-Solomon (GRS) codes.Also, values of the average probability of an undetected error are computed by using the average binary weight distribution for an ensemble of binary expansions of all GRS codes for some given concrete code parameters. By comparing these values with values of the upper and the lower bound computed by using the proposed weight enumerators, the effectiveness of those weight enumerators is shown in this paper.

作者: Toshihisa NISHIJIMA

作者单位: Faculty of Computer and Information Sciences, Hosei University Kajino-cho 3-7-2, Koganei-shi, Tokyo, 184-8584 Japan

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 37-41

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）