Next Article in Journal
Heat Transport Hysteresis Generated Through Frequency Switching of a Time-Dependent Temperature Gradient
Previous Article in Journal
Relationship Between the 2019 Ridgecrest, California, MW7.1 Earthquake and Its MW6.4 Foreshock Sequence
Previous Article in Special Issue
Finite-Blocklength Analysis of Coded Modulation with Retransmission
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Editorial

Updates on Information Theory and Network Coding

School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen 518172, China
*
Author to whom correspondence should be addressed.
Entropy 2025, 27(1), 17; https://doi.org/10.3390/e27010017
Submission received: 20 December 2024 / Accepted: 26 December 2024 / Published: 30 December 2024
(This article belongs to the Special Issue Information Theory and Network Coding II)
Around the year 2000, network coding introduced the concept that coding can replace the basic packet forwarding operation used in traditional network communication systems [1,2,3]. This innovation simplified the achievement of maximum communication rates for unicast and improved the maximum communication rates for multicast. Random linear network coding (RLNC) bridged the gap between theory and practical applications by demonstrating that randomly selected linear combination coefficients are highly likely to be effective for linear network coding under some conditions [4,5]. Over the past two decades, significant research has focused on efficient RLNC. One notable approach is batched network coding (BNC), which integrates erasure coding with network coding in an outer-code inner-code manner (e.g., [6,7]).
Recently, network coding techniques have been discussed in 3GPP for 5G and within the Internet Research Task Force (IRTF), the research counterpart of the Internet Engineering Task Force (IETF). The Coding for Efficient Network Communication Research Group (NWCRG) of IRTF published six RFCs from 2018 to 2023. Network coding applications have been explored for satellite systems [8] and content-centric networking [9]. Two network coding protocols are described in [10,11], while the relationship between coding and congestion control is examined in [12].
As Guest Editors of this Special Issue of Entropy, titled “Information Theory and Network Coding II”, we are delighted to present ten cutting-edge research papers that explore advancements in coding theory and network coding. These papers cover a diverse array of subjects, such as finite-blocklength analysis (contribution 10), erasure coding (contribution 1), coded caching (contribution 8), vector-linear network coding (contribution 9), and secure network coding (contribution 6). Contribution 2 proposes a scalable RLNC scheme that adapts to the computational power of devices, while contribution 7 focuses on the application of RLNC in Vehicle-to-Vehicle (V2V) networks. Contributions 5 and 4 discuss the systematic design and adaptive recoding of BNC, respectively. Contribution 3 applies RLNC and BNC to distributed computation over lossy wireless networks.
We have witnessed rapid advancement in Large Language Models (LLMs) in recent years. This trend has provided numerous application scenarios for network coding and highlighted several promising directions for future research. Notably, training LLMs necessitates innovative GPU cluster networking technologies and distributed computation techniques. We eagerly anticipate the emergence of more groundbreaking research in network coding in the coming years.
We would like to express our sincere gratitude to all the authors who have contributed their high-quality work to this Special Issue. Their dedication and effort have made this collection of papers a reality. We also thank the reviewers for their time and expertise in evaluating the submitted manuscripts. Their constructive feedback has significantly enhanced the quality of the accepted papers. Furthermore, we are grateful to the Editorial Office of Entropy for their invaluable support and assistance in bringing this Special Issue to fruition.

Author Contributions

Writing—original draft preparation, S.Y.; writing—review and editing, K.W.S. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the National Natural Science Foundation of China under Grants 12141108, 62171399 and 62171400.

Conflicts of Interest

The authors declare no conflicts of interest.

List of Contributions

  • Zhou, W.; Hou, H. Three Efficient All-Erasure Decoding Methods for Blaum–Roth Codes. Entropy 2022, 24, 1499. https://doi.org/10.3390/e24101499.
  • Tang, H.; Zheng, R.; Li, Z.; Long, K.; Sun, Q. Scalable Network Coding for Heterogeneous Devices over Embedded Fields. Entropy 2022, 24, 1510. https://doi.org/10.3390/e24111510.
  • Fan, B.; Tang, B.; Qu, Z.; Ye, B. Network Coding Approaches for Distributed Computation over Lossy Wireless Networks. Entropy 2023, 25, 428. https://doi.org/10.3390/e25030428.
  • Yin, H.H.F.; Yang, S.; Zhou, Q.; Yung, L.M.L.; Ng, K.H. BAR: Blockwise Adaptive Recoding for Batched Network Coding. Entropy 2023, 25, 1054. https://doi.org/10.3390/e25071054.
  • Mao, L.; Yang, S.; Huang, X.; Dong, Y. Design and Analysis of Systematic Batched Network Codes. Entropy 2023, 25, 1055. https://doi.org/10.3390/e25071055.
  • Bai, Y.; Guang, X.; Yeung, R.W. Multiple Linear-Combination Security Network Coding. Entropy 2023, 25, 1135. https://doi.org/10.3390/e25081135.
  • Zhang, Y.; Zhu, T.; Li, C. Efficient Communications in V2V Networks with Two-Way Lanes Based on Random Linear Network Coding. Entropy 2023, 25, 1454. https://doi.org/10.3390/e25101454.
  • Wang, W.; Tao, Z.; Liu, N.; Kang, W. Fundamental Limits of Coded Caching in Request-Robust D2D Communication Networks. Entropy 2024, 26, 250. https://doi.org/10.3390/e26030250.
  • Tang, H.; Liu, H.; Jin, S.; Liu, W.; Sun, Q. On Matrix Representation of Extension Field GF(pL) and Its Application in Vector Linear Network Coding. Entropy 2024, 26, 822. https://doi.org/10.3390/e26100822.
  • Jiang, M.; Wang, Y.; Ding, F.; Xu, Q. Finite-Blocklength Analysis of Coded Modulation with Retransmission. Entropy 2024, 26, 863. https://doi.org/10.3390/e26100863.

References

  1. Koetter, R.; Medard, M. An Algebraic Approach to Network Coding. IEEE/ACM Trans. Netw. 2003, 11, 782–795. [Google Scholar] [CrossRef]
  2. Li, S.Y.R.; Yeung, R.W.; Cai, N. Linear network coding. IEEE Trans. Inform. Theory 2003, 49, 371–381. [Google Scholar] [CrossRef]
  3. Ahlswede, R.; Cai, N.; Li, S.Y.R.; Yeung, R.W. Network information flow. IEEE Trans. Inform. Theory 2000, 46, 1204–1216. [Google Scholar] [CrossRef]
  4. 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 Trans. Inform. Theory 2006, 52, 4413–4430. [Google Scholar] [CrossRef]
  5. Lun, D.S.; Médard, M.; Koetter, R.; Effros, M. On coding for reliable communication over packet networks. Phys. Commun. 2008, 1, 3–20. [Google Scholar] [CrossRef]
  6. Li, Y.; Soljanin, E.; Spasojevic, P. Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding. IEEE Trans. Inform. Theory 2011, 57, 1111–1123. [Google Scholar] [CrossRef]
  7. Yang, S.; Yeung, R.W. Batched Sparse Codes. IEEE Trans. Inform. Theory 2014, 60, 5322–5346. [Google Scholar] [CrossRef]
  8. Kuhn, N.; Lochin, E. Network Coding for Satellite Systems. RFC 8975, 2021. Available online: https://doi.org/10.17487/RFC8975 (accessed on 19 December 2024).
  9. Matsuzono, K.; Asaeda, H.; Westphal, C. Network Coding for Content-Centric Networking/Named Data Networking: Considerations and Challenges. RFC 9273, 2022. Available online: https://doi.org/10.17487/RFC9273 (accessed on 19 December 2024).
  10. Yang, S.; Huang, X.; Yeung, R.W.; Zao, D.J.K. BATched Sparse (BATS) Coding Scheme for Multi-hop Data Transport. RFC 9426, 2023. Available online: https://doi.org/10.17487/RFC9426 (accessed on 19 December 2024).
  11. Detchart, J.; Lochin, E.; Lacan, J.; Roca, V. Tetrys: An On-the-Fly Network Coding Protocol. RFC 9407, 2023. Available online: https://doi.org/10.17487/RFC9407 (accessed on 19 December 2024).
  12. Kuhn, N.; Lochin, E.; Michel, F.; Welzl, M. Forward Erasure Correction (FEC) Coding and Congestion Control in Transport. RFC 9265, 2022. Available online: https://doi.org/10.17487/RFC9265 (accessed on 19 December 2024).
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yang, S.; Shum, K.W. Updates on Information Theory and Network Coding. Entropy 2025, 27, 17. https://doi.org/10.3390/e27010017

AMA Style

Yang S, Shum KW. Updates on Information Theory and Network Coding. Entropy. 2025; 27(1):17. https://doi.org/10.3390/e27010017

Chicago/Turabian Style

Yang, Shenghao, and Kenneth W. Shum. 2025. "Updates on Information Theory and Network Coding" Entropy 27, no. 1: 17. https://doi.org/10.3390/e27010017

APA Style

Yang, S., & Shum, K. W. (2025). Updates on Information Theory and Network Coding. Entropy, 27(1), 17. https://doi.org/10.3390/e27010017

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop