Skip to main content
Erschienen in: Wireless Personal Communications 2/2018

19.12.2017

The Nonlinear Network Coding and Its Application in Error-Correcting Codes

verfasst von: Guangzhi Zhang, Shaobin Cai, Dongqiu Zhang

Erschienen in: Wireless Personal Communications | Ausgabe 2/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Nonlinear network coding is researched here. For determined network, Jaggi–Sanders algorithm is generalized to its nonlinear form for the the multicast network. Precise details of the algorithm implementation and the proof on the algorithm existence are given. The error-correcting codes for determined network coding is also proposed based on the traditional error-correcting codes for network coding. For random network, the nonlinear network coding scheme is proposed. It shows the nonlinear network coding has advantages in solving the so-called “all-or-nothing” problem caused by errors. Some interesting mathematical concepts such as shared agreements, composite functions and n-dimensional maximal independent set based on combinatorics are proposed. These new concepts may offer beneficial lessons for further research on nonlinear network coding.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Dougherty, R., Freiling, C., & Zeger, K. (2005). Insufficiency of linear coding in network information flow. Information Theory, IEEE Transactions, 51(8), 2745–2759.MathSciNetCrossRefMATH Dougherty, R., Freiling, C., & Zeger, K. (2005). Insufficiency of linear coding in network information flow. Information Theory, IEEE Transactions, 51(8), 2745–2759.MathSciNetCrossRefMATH
2.
Zurück zum Zitat Kobayashi, H., Le Gall, F., Nishimura, H., & Rotteler, M. (2011). Constructing quantum network coding schemes from classical nonlinear protocols. In Information theory proceedings (ISIT), 2011 IEEE international symposium on IEEE (pp. 109–113). Kobayashi, H., Le Gall, F., Nishimura, H., & Rotteler, M. (2011). Constructing quantum network coding schemes from classical nonlinear protocols. In Information theory proceedings (ISIT), 2011 IEEE international symposium on IEEE (pp. 109–113).
3.
Zurück zum Zitat Blasiak, A., Kleinberg, R., & Lubetzky, E. (2011). Lexicographic products and the power of non-linear network coding. In Foundations of computer science (FOCS), 2011 IEEE 52nd annual symposium on IEEE (pp. 609–618). Blasiak, A., Kleinberg, R., & Lubetzky, E. (2011). Lexicographic products and the power of non-linear network coding. In Foundations of computer science (FOCS), 2011 IEEE 52nd annual symposium on IEEE (pp. 609–618).
4.
Zurück zum Zitat Shadbakht, S., & Hassibi, B. (2010). MCMC methods for entropy optimization and nonlinear network coding. In Information theory proceedings (ISIT), IEEE international symposium on IEEE (pp. 2383–2387). Shadbakht, S., & Hassibi, B. (2010). MCMC methods for entropy optimization and nonlinear network coding. In Information theory proceedings (ISIT), IEEE international symposium on IEEE (pp. 2383–2387).
5.
Zurück zum Zitat Li, Q., Ting, S. H., & Ho, C. K. (2009). Nonlinear network code for high throughput broadcasting with retransmissions. In Information theory, 2009. ISIT 2009 IEEE international symposium on IEEE (pp. 2853–2857). Li, Q., Ting, S. H., & Ho, C. K. (2009). Nonlinear network code for high throughput broadcasting with retransmissions. In Information theory, 2009. ISIT 2009 IEEE international symposium on IEEE (pp. 2853–2857).
6.
Zurück zum Zitat Wernersson, N., & Skoglund, M. (2009). Nonlinear coding and estimation for correlated data in wireless sensor networks. IEEE Transactions on Communications, 57(10), 2932–2939.CrossRef Wernersson, N., & Skoglund, M. (2009). Nonlinear coding and estimation for correlated data in wireless sensor networks. IEEE Transactions on Communications, 57(10), 2932–2939.CrossRef
7.
Zurück zum Zitat Dougherty, R., Freiling, C., & Zeger, K. (2006). Unachievability of network coding capacity. Information Theory IEEE Transactions, 52(6), 2365–2372.MathSciNetCrossRefMATH Dougherty, R., Freiling, C., & Zeger, K. (2006). Unachievability of network coding capacity. Information Theory IEEE Transactions, 52(6), 2365–2372.MathSciNetCrossRefMATH
8.
Zurück zum Zitat Langberg, M., & Sprintson, A. (2008). On the hardness of approximating the network coding capacity. In Information theory, 2008. ISIT 2008 IEEE international symposium (pp. 1008–1014) Langberg, M., & Sprintson, A. (2008). On the hardness of approximating the network coding capacity. In Information theory, 2008. ISIT 2008 IEEE international symposium (pp. 1008–1014)
9.
Zurück zum Zitat Lehman, A. R., & Lehman, E. (2004). Complexity classification of network information flow problems. In Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms (pp. 142–150). Society for Industrial and Applied Mathematics. Lehman, A. R., & Lehman, E. (2004). Complexity classification of network information flow problems. In Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms (pp. 142–150). Society for Industrial and Applied Mathematics.
10.
Zurück zum Zitat Medard, M., & Koetter, R. (2002). Beyond routing: An algebraic approach to network coding. Proceedings of IEEE INFOCOM, 1(5), 122–130. Medard, M., & Koetter, R. (2002). Beyond routing: An algebraic approach to network coding. Proceedings of IEEE INFOCOM, 1(5), 122–130.
11.
Zurück zum Zitat Sanders, P., Egner, S., & Tolhuizen, L. (2003). Polynomial time algorithms for network information flow. In ACM symposium on parallel algorithms and architectures (pp. 286–294). Sanders, P., Egner, S., & Tolhuizen, L. (2003). Polynomial time algorithms for network information flow. In ACM symposium on parallel algorithms and architectures (pp. 286–294).
12.
Zurück zum Zitat Li, L., & Long, D. (2008). Nonlinear network coding: A case study. Computer Science, 7, 020. Li, L., & Long, D. (2008). Nonlinear network coding: A case study. Computer Science, 7, 020.
13.
Zurück zum Zitat Guang, X., Fu, F. W., & Zhang, Z. (2010). Construction of network error correction codes in packet networks. IEEE Transactions on Information Theory, 59(2), 1030–1047.MathSciNetCrossRefMATH Guang, X., Fu, F. W., & Zhang, Z. (2010). Construction of network error correction codes in packet networks. IEEE Transactions on Information Theory, 59(2), 1030–1047.MathSciNetCrossRefMATH
14.
Zurück zum Zitat Bachmann, O., Greuel, G. M., Lossen, C., Pfister, G., & Schönemann, H. A. (2007). Singular introduction to commutative algebra. Berlin: Springer. Bachmann, O., Greuel, G. M., Lossen, C., Pfister, G., & Schönemann, H. A. (2007). Singular introduction to commutative algebra. Berlin: Springer.
15.
Zurück zum Zitat Fengkeqin, L. (2011). The finite field and its application. Dalian: Dalian University of Technology Press. Fengkeqin, L. (2011). The finite field and its application. Dalian: Dalian University of Technology Press.
16.
Zurück zum Zitat ZongpengLi, J. (2012). Network coding principles. Islamabad: National Defence Industry Press. ZongpengLi, J. (2012). Network coding principles. Islamabad: National Defence Industry Press.
17.
Zurück zum Zitat Yang, S., Yeung, R. W., & Chi, K. N. (2011). Refined coding bounds and code constructions for coherent network error correction. IEEE Transactions on Information Theory, 57(3), 1409–1424.MathSciNetCrossRefMATH Yang, S., Yeung, R. W., & Chi, K. N. (2011). Refined coding bounds and code constructions for coherent network error correction. IEEE Transactions on Information Theory, 57(3), 1409–1424.MathSciNetCrossRefMATH
18.
Zurück zum Zitat Guang, X., Fu, F. W., & Zhang, Z. (2013). Construction of network error correction codes in packet networks. IEEE Transactions on Information Theory, 59(2), 1030–1047.MathSciNetCrossRefMATH Guang, X., Fu, F. W., & Zhang, Z. (2013). Construction of network error correction codes in packet networks. IEEE Transactions on Information Theory, 59(2), 1030–1047.MathSciNetCrossRefMATH
19.
Zurück zum Zitat Matsumoto, R. (2006). Construction algorithm for network error-correcting codes attaining the singleton bound. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 90(9), 1729–1735.CrossRef Matsumoto, R. (2006). Construction algorithm for network error-correcting codes attaining the singleton bound. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 90(9), 1729–1735.CrossRef
Metadaten
Titel
The Nonlinear Network Coding and Its Application in Error-Correcting Codes
verfasst von
Guangzhi Zhang
Shaobin Cai
Dongqiu Zhang
Publikationsdatum
19.12.2017
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 2/2018
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-017-5109-z

Weitere Artikel der Ausgabe 2/2018

Wireless Personal Communications 2/2018 Zur Ausgabe

Neuer Inhalt