Bounds on codes based on graph theory

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 1876-1879

  El Rouayheb, Salim Y ^a   Georghiades, Costas N ^a   Soljanin, Emina ^b   Sprintson, Alex ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM;

GRAPH THEORY; INFORMATION THEORY; TOPOLOGY;

TECHNICAL PRESENTATIONS;

EID: 51649111427     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557151     Document Type: Conference Paper

References (16)

1. F. J. Macwilliams and N. J. A. Sloane, The Theory of Error-Correcting-Codes, North-Holland, 1977.
2. N. J. A. Sloane, "Unsolved Problems in Graph Theory Arising from the Study of Codes," Graph Theory Notes of New York, 1989.
3. R. Ahlswede and L. H. Khachatrian, "The Diametric Theorem in Hamming Spaces - Optimal anticodes," Adv. in Appl. Math, vol. 20, pp. 429-149, 1998.
4. R. Ahlswede and L. H. Khachatrian, "The Complete Intersection Theorem for Systems of Finite Sets," European Journal of Combinatorics, vol. 18, pp. 125-136, 1997.
5. P. Frankl and N. Tokushige, "The Erdos-Ko-Rado Theorem for Integer Sequences," Combinatorica, vol. 19, pp. 55-63, 1999.
6. R. Diestel, Graph Theory, Springer, 2006.
7. C. Godsil and G. Royle, Algebraic Graph Theory, Springer, 2001.
8. D. J. Kleitman, "On a Combinatorial Conjecture of Erdos," J. of Combinatorial Theory, vol. 1, pp. 209-214, 1966.
9. R. Matsumoto, K. Kurosawa, T. Itoh, T. Konno and T. Uyematsu, "Primal-Dual Distance Bounds of Linear Codes with Applications to Cryptography," IEEE Trans. Inform. Th., vol. 52, pp. 4251-4256, 2006.
10. E. Agrell, A. Vardy and K. Zeger, "Upper Bounds for Constant-Weight Codes," IEEE Trans. Inform. Theory, vol. 46, pp. 2373-2395, 2000.
11. S. M. Johnson, "A new upper bound for error-correcting codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 203-207, 1962.
12. V. I. Levenshtein, "Upper Bound Estimates For Fixed-Weight Codes," Probl. Inform. Trans., vol. 7, pp. 281-287, 1974.
13. P. Erdos, C. Ko and R. Rado, "Intersection Theorems for systems of finite sets," Quart. J. Math. Oxford, vol. 12, pp. 313-320, 1961.
14. R. M. Wilson, "The exact bound on the Erdos-ko-Rado Theorem," Combinatorica, vol. 4, pp. 247-260, 1984.
15. L. Lovász, "On the Shannon Capacity of a Graph," IEEE Trans. Inform. Theory, vol. IT-25, pp. 1-7, 1979.
16. C.E. Shannon, "The Zero Error Capacity of a Noisy Channel," vol. IT-2, pp. 8-19, 1956.