scholarly journals A Survey of Linear Network Coding and Network Error Correction Code Constructions and Algorithms

2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
Michele Sanna ◽  
Ebroul Izquierdo
Keyword(s):  
Network Coding ◽  
Network Control ◽  
Practical Implementation ◽  
Error Protection ◽  
New Paradigm ◽  
Linear Network ◽  
Linear Network Coding ◽  
Store And Forward ◽  
Code Constructions ◽  
Construction Algorithms

Network coding was introduced by Ahlswede et al. in a pioneering work in 2000. This paradigm encompasses coding and retransmission of messages at the intermediate nodes of the network. In contrast with traditional store-and-forward networking, network coding increases the throughput and the robustness of the transmission. Linear network coding is a practical implementation of this new paradigm covered by several research works that include rate characterization, error-protection coding, and construction of codes. Especially determining the coding characteristics has its importance in providing the premise for an efficient transmission. In this paper, we review the recent breakthroughs in linear network coding for acyclic networks with a survey of code constructions literature. Deterministic construction algorithms and randomized procedures are presented for traditional network coding and for network-control network coding.

scholarly journals A proposed P2P Kurdistan Academic Network Backbone (KANB), Based on Random Linear Network Coding

2017 ◽  
Vol 2 (3) ◽  
pp. 50-55
Author(s):  
Raghad Z. Yousif ◽  
Rami S. Youeel ◽  
Ferman I Kareem
Keyword(s):  
Network Coding ◽  
Computer Network ◽  
Kurdistan Region ◽  
Bandwidth Utilization ◽  
Linear Network ◽  
Linear Network Coding ◽  
Random Linear Network Coding ◽  
Academic Network ◽  
Network Backbone ◽  
Store And Forward

The current rate of growth in computer network usage is a problematic issue motivates the inspiration to investigate less conventional solutions, similar to Network Coding (NC) which has attracted a lot of attention lately, to improve the bandwidth utilization and latency in computer networks. The objective of this paper is to show that the usage of Network coding is possible on enhancing the execution of Kurdistan Academic Network Backbone (KANB) to associate the primary ten urban communities in Kurdistan Region that almost contains a greater part of academic institutions. The proposed model applies peer to peer (P2P) multicasting on KANB, which does not require any centralized knowledge about the topology of the network. The Random Linear Network Coding (RLNC) has been utilized for its superior properties to address the problems of delay, throughput and lake of security associated with store-and-forward based classical networks. Simulation results point out the advantages of using network coding over the classical (store and forward) technique in term of improving the throughput gain and latency reduction. Hawler city the capital and greatest city in Kurdistan Region have been chosen as a source node while Slemani city has been elected as a sink, node. Thus, Network coding is applied at intermediate nodes.

On the Optimal Linear Network Coding Design for Information Theoretically Secure Unicast Streaming

2016 ◽  
Vol 18 (6) ◽  
pp. 1149-1162 ◽  
Author(s):  
Jin Wang ◽  
Jianping Wang ◽  
Kejie Lu ◽  
Yi Qian ◽  
Naijie Gu
Keyword(s):  
Network Coding ◽  
Linear Network ◽  
Linear Network Coding ◽  
Optimal Linear

scholarly journals Semantically Secure Symmetric Encryption with Error Correction for Distributed Storage

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Juha Partala
Keyword(s):  
Error Correction ◽  
Network Coding ◽  
Linear Combination ◽  
Distributed Storage ◽  
Homomorphic Encryption ◽  
Error Correcting Codes ◽  
Symmetric Encryption ◽  
Goppa Codes ◽  
Linear Network ◽  
Linear Network Coding

A distributed storage system (DSS) is a fundamental building block in many distributed applications. It applies linear network coding to achieve an optimal tradeoff between storage and repair bandwidth when node failures occur. Additively homomorphic encryption is compatible with linear network coding. The homomorphic property ensures that a linear combination of ciphertext messages decrypts to the same linear combination of the corresponding plaintext messages. In this paper, we construct a linearly homomorphic symmetric encryption scheme that is designed for a DSS. Our proposal provides simultaneous encryption and error correction by applying linear error correcting codes. We show its IND-CPA security for a limited number of messages based on binary Goppa codes and the following assumption: when dividing a scrambled generator matrix G^ into two parts G1^ and G2^, it is infeasible to distinguish G2^ from random and to find a statistical connection between G1^ and G2^. Our infeasibility assumptions are closely related to those underlying the McEliece public key cryptosystem but are considerably weaker. We believe that the proposed problem has independent cryptographic interest.

scholarly journals Exact Decoding Probability Under Random Linear Network Coding

2011 ◽  
Vol 15 (1) ◽  
pp. 67-69 ◽  
Author(s):  
Oscar Trullols-Cruces ◽  
Jose M. Barcelo-Ordinas ◽  
Marco Fiore
Keyword(s):  
Network Coding ◽  
Linear Network ◽  
Linear Network Coding ◽  
Random Linear Network Coding

Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams

2013 ◽  
Vol 24 (10) ◽  
pp. 2025-2035 ◽  
Author(s):  
Jin Wang ◽  
Jianping Wang ◽  
Kejie Lu ◽  
Bin Xiao ◽  
Naijie Gu
Keyword(s):  
Optimal Design ◽  
Network Coding ◽  
Multiple Streams ◽  
Linear Network ◽  
Linear Network Coding
Sign in / Sign up

Export Citation Format

Share Document