Upper bounds for binary linear codes based on the Terwiiliger algebra and semidefinite programming

摘要：

In this paper, we consider the problem of upper bounds for binary linear codes. We modify the Schijvers SDP model in 1 for binary codes, which is based on the Terwilliger algebra. In our modified model, we fix a binary linear code of word length n and minimum Hamming distance d and obtain the upper bound for the binary linear code words A(n,d).At last, we verify our model for fixed values of n andd.

关键词： Terwilliger algebra block-diagonalizing semidefinite programming binary linear codes

作者: Xiaowei Luo Yanqin Bai

作者单位: Department of Mathematics, Shanghai University, Shanghai 200444, China

会议类型: 国际会议

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

会议地点: 杭州

会议语种:英文

页码: 853-857

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