DocumentCode
2678518
Title
On the Linear Programming Bounds for Constant Dimension Codes
Author
Zhang, Zong-Ying ; Jiang, Yong ; Xia, Shu-Tao
Author_Institution
Grad. Sch. at Shenzhen, Tsinghua Univ., Shenzhen, China
fYear
2011
fDate
25-27 July 2011
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
error correction codes; linear programming; network coding; codewords; constant dimension codes; error correction; linear programming; random network coding; Authentication; Error correction codes; Linear programming; Network coding; Polynomials; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Coding (NetCod), 2011 International Symposium on
Conference_Location
Beijing
Print_ISBN
978-1-61284-138-0
Type
conf
DOI
10.1109/ISNETCOD.2011.5978916
Filename
5978916
Link To Document