Advertisement

On Field Size and Success Probability in Network Coding

  • Olav Geil
  • Ryutaroh Matsumoto
  • Casper Thomsen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5130)

Abstract

Using tools from algebraic geometry and Gröbner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear network coding. These estimates take into account which monomials occur in the support of the determinant of the product of Edmonds matrices. Therefore we finally investigate which monomials can occur in the determinant of the Edmonds matrix.

Keywords

Distributed networking linear network coding multicast network coding random network coding 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory 46(4), 1204–1206 (2000)CrossRefMathSciNetzbMATHGoogle Scholar
  2. 2.
    Becker, T., Weispfenning, V.: Gröbner Bases - A Computational Approach to Commutative Algebra. Springer, Berlin (1993)zbMATHGoogle Scholar
  3. 3.
    Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 2nd edn. Springer, Berlin (1996)zbMATHGoogle Scholar
  4. 4.
    Fragouli, C., Soljanin, E.: Network Coding Fundamentals. In: Foundations and Trends in Networking, vol. 2(1). now Publishers Inc., Hanover (2007)Google Scholar
  5. 5.
    Geil, O.: On codes from norm-trace curves. Finite Fields and their Applications 9(3), 351–371 (2003)CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    Ho, T., Karger, D.R., Médard, M., Koetter, R.: Network Coding from a Network Flow Perspective. In: Proceedings. IEEE International Symposium on Information Theory, Yokohama, Japan, July 2003, p. 441 (2003)Google Scholar
  7. 7.
    Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Information Theory 52(10), 4413–4430 (2006)CrossRefGoogle Scholar
  8. 8.
    Jaggi, S., Chou, P.A., Jain, K.: Low Complexity Algebraic Multicast Network Codes. In: Proceedings. IEEE International Symposium on Information Theory, Yokohama, Japan, July 2003, p. 368 (2003)Google Scholar
  9. 9.
    Koetter, R., Médard, M.: An Algebraic Approach to Network Coding. IEEE/ACM Transactions on Networking 11(5), 782–795 (2003)CrossRefGoogle Scholar
  10. 10.
    Li, S.-Y.R., Yeung, R.W., Cai, N.: Linear Network Coding. IEEE Transactions on Information Theory 49(2), 371–381 (2003)CrossRefMathSciNetzbMATHGoogle Scholar
  11. 11.
    Sanders, P., Egner, S., Tolhuizen, L.: Polynomial Time Algorithms for Network Information Flow. In: Proceedings of the 15th ACM Symposium on Parallel Algorithms, San Diego, USA, June 2003, pp. 286–294 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Olav Geil
    • 1
  • Ryutaroh Matsumoto
    • 2
  • Casper Thomsen
    • 1
  1. 1.Department of Mathematical SciencesAalborg UniversityDenmark
  2. 2.Department of Communications and Integrated SystemsTokyo Institute of TechnologyJapan

Personalised recommendations