One family of algebraic codes for network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2863-2866

  Bossert, Martin ^a   Gabidulin, Ernst M ^b  

^a UNIVERSITY OF ULM   (Germany)

^b MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC CODES; LARGE DIMENSIONS; NETWORK CODING; SINGLETON BOUND; SUBSPACE METRIC;

INFORMATION THEORY;

EID: 70449508082     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205280     Document Type: Conference Paper

References (20)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, pp. 1204- 1216, July 2000.
2. R. W. Yeung and N. Cai, "Network error correction, I: Basic concepts and upper bounds," Communication and Information Systems, vol. 6, pp. 19-35, 2006.
3. N. Cai and R. W. Yeung, "Network error correction, II: Lower bounds," Communication and Information Systems, vol. 6, pp. 37-54, 2006.
4. Z. Zhang, "Network error correction coding in packetized networks," IEEE Information Theory Workshop, October 2006.
5. S. Yang and R. W. Yeung, "Characterizations of network error correction/ detection and erasure correction," Network Coding Workshop, January 2007.
6. S. Yang, C. K. Ngai, and R. W. Yeung, "Construction of linear network codes that achieve a refined Singleton bound," in Proceedings of 2007 IEEE International Symposium on Information Theory (ISIT 2007), June 2007.
7. T. Ho, M. Medard, and R. Koetter, "An information-theoretic view of network management," IEEE Transactions on Information Theory, vol. 51, pp. 1295-1312, April 2005.
8. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," in Proceedings of 2007 IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, 24-29 June 2007, pp. 791-795.
9. P. Delsarte, "Association schemes and t-designs in regular semilattices," J. Combinatorial Theory Ser. A 20 (1976), no. 2, 230 243.
10. P. Delsarte, "Properties and applications of the recurrence F(i + 1; k + 1; n + 1) = qk+1F(i; k + 1; n) .. qkF(i; k; n)," SIAM J. Appl. Math. 31 (1976), no. 2, 262270.
11. P. Delsarte, "Hahn polynomials, discrete harmonics, and t-designs," SIAM J. Appl. Math. 34 (1978), no. 1, 157166.
12. P. V. Ceccherini, "A q-analogous of the characterization of hypercubes as graphs," J. of Geometry, vol. 22, pp. 57-74, 1984.
13. A. Barg and D. Nogin, "Spectral approach to linear programming bounds on codes," Problems of Information Transmission 42 (2006), 1225; arXiv:cs/0512025.
14. D. Silva and F. R. Kschischang, "Using rank-metric codes for error correction in random network coding," in Proceedings of 2007 IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, 24-29 June 2007.
15. E.M. Gabidulin, "Theory of Codes with Maximum Rank Distance," Probl. Inform. Transm., vol. 21, No. 1, pp. 1-12, July, 1985.
16. E.M.Gabidulin, A.V. Paramonov, O.V. Tretjakov "Rank Errors and Rank Erasures Correction," in Proceedings of the 4th International Colloquium on Coding Theory, 30 Sept. - 7 Oct. 1991, Dilijan, Armenia, pp. 11-19, Yerevan, 1992.
17. E. M. Gabidulin, "A Fast Matrix Decoding Algorithm For Rank-Error- Correcting Codes." In: (Eds G. Cohen, S. Litsyn, A. Lobstein, G. Zemor), Algebraic coding , pp. 126-132, Lecture Notes in Computer Science No. 573, Springer-Verlag, Berlin, 1992.
18. E. M. Gabidulin and N. I. Pilipchuk. "Error and erasure correcting algorithms for rank codes". Designs, Codes and Cryptography, Springer Netherlands, DOI 10.1007/s10623-008-9185-7. Online: 11 March 2008. V.49, No. 1-3/December 2008.
19. E. M. Gabidulin, N. I. Pilipchuk, "Symmetric rank codes". Problems of Information Transmission, v. 40, No. 2, pp. 3-17, 2004.
20. Gabidulin E., Bossert M. "Codes for Network Coding," Proc. of the 2008 IEEE International Symposium on Information Theory (ISIT 2008), pp. 867-870.