2010/08/25 by Salah A. Aly, Aly, Salah A., Ahmed E. Kamal +4
Computer Science · Mathematics · #Coding theory and cryptography #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #cs.IT #cs.NI #math.IT
paper · pdf · doi:10.48550/arxiv.1008.4264
ITW2010
arxiv created 2010/08/25 · openalex publication_date 2010/08/25 · arxiv updated 2010/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Link and node failures are two common fundamental problems that affect operational networks. Protection of communication networks against such failures is essential for maintaining network reliability and performance. Network protection codes (NPC) are proposed to protect operational networks against link and node failures. Furthermore, encoding and decoding operations of such codes are well developed over binary and finite fields. Finding network topologies, practical scenarios, and limits on graphs applicable for NPC are of interest. In this paper, we establish limits on network protection design. We investigate several network graphs where NPC can be deployed using network coding. Furthermore, we construct graphs with minimum number of edges suitable for network protection codes deployment.