Constant-rank codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 876-880

  Gadouleau, Maximilien ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR-CONTROL; INTERNATIONAL SYMPOSIUM; NON-COHERENT; RANDOM NETWORKS;

CODES (SYMBOLS); CYBERNETICS; INFORMATION THEORY; PROGRAMMING THEORY; TECHNICAL PRESENTATIONS;

CODES (STANDARDS);

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

References (20)

1. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Info. Theory, vol. 52, no. 10, pp. 4413-4430, October 2006.
2. R. W. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds," Commun. Inform. Syst., vol. 6, no. 1, pp. 19-36, 2006.
3. N. Cai and R. W. Yeung, "Network error correction, part II: Lower bounds," Commun. Inform. Syst., vol. 6, no. 1, pp. 37-54, 2006.
4. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," submitted to IEEE Trans. Info. Theory, available at http://arxiv.org/abs/cs/0703061.
5. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," submitted to IEEE Trans. Info. Theory, available at http://arxiv.org/abs/0711.070S.
6. L. Chihara, "On the zeros of the Askey-Wilson polynomials with applications to coding theory," SIAMJ. Math. Anal., vol. 8, pp. 191-207, 1987.
7. P. Delsarte, "Bilinear forms over a finite field, with applications to coding theory," Journal of Combinatorial Theory A, vol. 25, pp. 226-241, 1978.
8. E. M. Gabidulin, "Theory of codes with maximum rank distance," Problems on Information Transmission, vol. 21, no. 1, pp. 1-12, Jan. 1985.
9. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Info. Theory, vol. 37, no. 2, pp. 328-336, March 1991.
10. E. M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov, "Ideals over a non-commutative ring and their application in cryptology," LNCS, vol. 573, pp. 482-489, 1991.
11. P. Lusina, E. M. Gabidulin, and M. Bossert, "Maximum rank distance codes as space-time codes," IEEE Trans. Info. Theory, vol. 49, pp. 2757-2760, Oct. 2003.
12. E. Agrell, A. Vardy, and K. Zeger, "Upper bounds for constant-weight codes," IEEE Trans. Info. Theory, vol. 46, no. 7, pp. 2373-2395, Nov. 2000.
13. G. E. Andrews, The Theory of Partitions, ser. Encyclopedia of Mathematics and its Applications, G.-C. Rota, Ed. Reading, MA: Addison-Wesley, 1976, vol. 2.
14. M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes," to appear in IEEE Trans. Info. Theory, available at http://arxiv.org/pdf/cs.IT/ 0612051.
15. S.-T. Xia and F.-W. Fu, "Johnson type bounds on constant dimension codes," submitted to Designs, Codes and Cryptography, Sept. 2007, available at http://arxiv.org/abs/0709.1074.
16. H. Wang, C. Xing, and R. Safani-Naini, "Linear authentication codes: Bounds and constructions," IEEE Trans. Info. Theory, vol. 49, no. 4, pp. 866-872, April 2003.
17. S. Y. El Rouayheb, C. N. Georghiades, E. Soljanin, and A. Sprintson, "Bounds on codes based on graph theory," Proc. IEEE Int. Sytnp. on Information Theory, pp. 1876-1879, June 2007.
18. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, ser. A Series of Modern Surveys in Mathematics. Springer-Verlag, 1989, vol. 18, no. 3.
19. L. A. Bassalygo, "New upper bounds for error correcting codes," Problems of Information Transmission, vol. 1, no. 4, pp. 32-35, 1968.
20. S. M. Johnson, "A new upper bound for error-correcting codes," IRE Trans. Info. Theory, vol. 8, pp. 203-207, 1962.