On the linear programming bounds for constant dimension codes

2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings

Volumn , Issue , 2011, Pages

  Zhang, Zong Ying ^a   Jiang, Yong ^a   Xia, Shu Tao ^a,b  

^a TSINGHUA UNIVERSITY   (China)

^b SOUTHEAST UNIVERSITY   (China)

Author keywords

constant dimension codes; linear programming; random network coding

Indexed keywords

CODE-WORDS; CONSTANT DIMENSION CODES; CORRECT ERROR; JOHNSON BOUND; RANDOM NETWORK CODING;

CODING ERRORS; INFORMATION THEORY; LINEAR PROGRAMMING; RANDOM ERRORS;

NETWORK CODING;

EID: 80053049782     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISNETCOD.2011.5978916     Document Type: Conference Paper

References (18)

1. T. Ho, R. Koetter, M. Médard, D. Karger, and M. Effros, The benefits of coding over routing in a randomized setting, in Proc. IEEE Int. Symp. Inform. Theory, p. 442, Yokohama, Japan, June 29 - July 4, 2003.
2. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, A random linear network coding approach to multicast, IEEE Trans. Inform. Theory, vol. 52, pp. 4413-4430, Oct. 2006.
3. R. Koetter and F. Kschischang, Coding for errors and erasures in random network coding, IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
4. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inform. Theory, vol. 54, no. 9, pp. 3951-3967, Sep. 2008.
5. H. Wang, C. Xing, and R. Safavi-Naini, "Linear authentication codes: bounds and constructions," IEEE Trans. Inform. Theory, vol. 49, no. 4, pp. 866-872, Apr. 2003.
6. S. T. Xia and F. W. Fu, "Johnson type bounds on constant dimension codes," Designs, Codes, Cryptography, vol. 50, pp. 163-172, Feb. 2009.
7. T. Etzion and A. Vardy, "Error-correcting codes in projective space," in Proc. IEEE Int. Symp. Information Theory, pp. 871-875, Toronto, ON, Canada, Jul. 2008.
8. T. Etzion and N. Silberstein, "Error-correcting codes in projective spaces via rank-metric codes and ferrers diagrams," IEEE Trans. Inform. Theory, vol. 55, no. 7, pp. 2909-2919, Jul. 2009.
9. D. Silva and F. R. Kschischang, "On metrics for error correction in network coding," IEEE Trans. Inform. Theory, vol. 55, no. 10, pp. 5479-5490, Dec. 2009.
10. V. Skachek, "Recursive code construction for random networks," IEEE Trans. Inform. Theory, vol. 56, no. 3, pp. 1378-1382, Mar. 2010.
11. M. Gadouleau and Z. Yan,"Constant-rank codes and their connection to constant-dimension codes," IEEE Trans. Inform. Theory, vol. 56, no. 7, pp. 3207-3216, Jul. 2010.
12. P. Delsarte, "Bounds for unrestricted codes, by linear programming," Philips Res. Reports, vol. 27, pp. 272-289, 1972.
13. P. Delsarte, "An algebraic approach to the association schemes of coding theory," Philips Res. Reports, Suppl. 10, 1973.
14. P. Delsarte, "Association schemes and t-designs in regular semilattices," Journal of Combinatorial Theory A, vol. 20, pp. 230-243, 1976.
15. kF(i, k, n)," SIAM Journal of Applied Mathematics, vol. 31, no. 2, pp. 262-270, Sep. 1976.
16. R. J. McEliece, E. R. Rodemich, H. Rumsey, Jr., and L. R. Welch, "New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. 23, no. 2, pp. 157-166, Mar. 1977.
17. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, North-Holland, Amsterdam, 1981.
18. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.