On the Linear Programming Bounds for Constant Dimension Codes

摘要：

Recently, constant dimension codes were introduced to correct errors and/or erasures over the operator channel in random network coding. In this paper, we study the problem of maximum number of codewords for constant dimension codes by linear programming (LP) approach. We give LP bounds and then show that the compact Johnson bound is a special case of the proposed LP bounds.

作者: Zong-Ying Zhang Yong Jiang Shu-Tao Xia

作者单位: Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China

会议类型: 国际会议

会议名称: 2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)

会议地点: 北京

会议语种:英文

页码: 1-4

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