Skip to main content
SpringerLink
Log in

Performance Improvement of Kötter and Kschischang Codes and Lifted Rank Metric Codes in Random Linear Network Coding

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Future networks require low latency communications which can be achieved using Network Coding. While random linear network coding is an effective technique for disseminating information in networks, it is highly sensitive to error propagation. Classical error correction codes are therefore inadequate to solve the problem, which requires new techniques. Recently, Kötter and Kschischang (KK) codes, have been proposed for error control in non-coherent random linear network coding. These codes can also be constructed from the lifting of rank metric codes (LRMC) as Gabidulin codes. In this paper, we first propose a novel coding scheme in mesh networks to improve the performance of KK and LRMC codes in random linear network coding, using cyclic redundancy check (CRC) codes to prevent error propagation. Then, we give a performance evaluation and comparison between KK and LRMC codes in terms of Packet Error Rate (PER) without and with error detection. Simulation results show that a significant performance improvement in terms of PER is achieved using our proposed scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Cai N, Yeung RW (2006) Network error correction. part ii: Lower bounds Communications in Information and Systems 6:37–54. doi:https://doi.org/10.4310/CIS.2006.v6.n1.a3

    Article  MATH  Google Scholar 

  2. Yeung RW, Cai N (2006) Network error correction. part i: Basic concepts and upper bounds Communications in Infomation and Systems 6:19–36. doi:https://doi.org/10.4310/CIS.2006.v6.n1.a2

    Article  MATH  Google Scholar 

  3. Zhang Z (2008) Linear network error correction codes in packet networks. IEEE Trans Inf Theorys 54(1):209–218. doi:https://doi.org/10.1109/TIT.2007.909139

    Article  MathSciNet  MATH  Google Scholar 

  4. Koetter R, Kschischang F (2008) Coding for errors and erasures in random network coding. IEEE Trans Inf Theorys 54(8):3579–3591. doi:https://doi.org/10.1109/TIT.2008.926449

    Article  MathSciNet  MATH  Google Scholar 

  5. Silva D, Kschischang F, Koetter R (2008) A rank metric approach to error control in random network coding. IEEE Trans Inf Theorys 54(9):3951–3967. doi:https://doi.org/10.1109/TIT.2008.928291

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen N, Yan Z, Gadouleau M, Wang Y (2012) .Suter, Rank metric decoder architectures for random linear network coding with error control. IEEE Trans 20(2):296–309. doi:https://doi.org/10.1109/TVLSI.2010.2096239

    Article  Google Scholar 

  7. Gabidulin EM (1985) Theory of codes with maximum rank distance. Probl Inf Transm 21(1):1–12

    MathSciNet  MATH  Google Scholar 

  8. Guefrachi A, Zaibi S, Bouallgue A (2016) NCS-EC: Network coding simulator with error control, 16th International Conference on Computational Science and its Applications (ICCSA’2016) 9786 of the series LNCS (10) 480–490. doi:https://doi.org/10.1007/978-3-319-42085-1\_37

  9. Medard M, Sprintson A (2011) Network coding: Fundamentals and applications, Academic Press, 1 edition, Jan.

  10. K. C., H. M., K. J., C. D.J., On the optimal block length for joint channel and network coding,Information Theory Workshop (ITW)528–532doi: https://doi.org/10.1109/ITW.2011.6089518

  11. Ho T, Koette R, Medard M, Effros M, Shi J, Karger D (2006) A random linear net-work coding approach to multicast. IEEE Trans Inf Theorys 52(10):14413–14430. doi:https://doi.org/10.1109/TIT.2006.881746

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Communication Systems Laboratory, National Engineering School of Tunis, Tunis El Manar University, 1002, Belvédère Tunis, Tunisia

    Aicha Guefrachi, Sarra Nighaoui, Sonia Zaibi & Ammar Bouallegue

Authors
  1. Aicha Guefrachi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sarra Nighaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sonia Zaibi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ammar Bouallegue
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aicha Guefrachi.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guefrachi, A., Nighaoui, S., Zaibi, S. et al. Performance Improvement of Kötter and Kschischang Codes and Lifted Rank Metric Codes in Random Linear Network Coding. Mobile Netw Appl 28, 168–177 (2023). https://doi.org/10.1007/s11036-022-02043-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-022-02043-0

Keywords

Search

Navigation