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.