The Resaearch on the Minimum Distance of Generalized Hadamard Codes

摘要：

The problem about the minimum distance of generalized Hadamard code C is discussed. This paper derived that the generalized Hadamard code C was a code in F2n, the length of the code was n, and the dimension was 2(n+1). Moreover, the minimum distance of generalized Hadamard codes is (n-3)/2, which is proved finally.

关键词： Length of the code Dimension Minimum distance

作者: Shuyun Cai

作者单位: Department of Mathematics, Beihua University, Jilin 132013, China

会议类型: 国际会议

会议名称: The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)

会议地点: 杭州

会议语种:英文

页码: 945-948

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