Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach
نویسندگان
چکیده
منابع مشابه
Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach
We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can be arbitrary. Secure network coding is applied to prevent the source information from being leaked to the wiretappers. In secure network coding, the required alphabet size is an op...
متن کاملNetwork synchronizability analysis: a graph-theoretic approach.
This paper addresses the fundamental problem of complex network synchronizability from a graph-theoretic approach. First, the existing results are briefly reviewed. Then, the relationships between the network synchronizability and network structural parameters (e.g., average distance, degree distribution, and node betweenness centrality) are discussed. The effects of the complementary graph of ...
متن کاملA Graph-Theoretic Visualization Approach to Network Risk Analysis
This paper describes a software system that provides significant new capabilities for visualization and analysis of network attack graphs produced through Topological Vulnerability Analysis (TVA). The TVA approach draws on a database of known exploits and system vulnerabilities to provide a connected graph representing possible cyber-attack paths within a given network. Our visualization approa...
متن کاملSecure Network Coding for a P2P System
Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throug...
متن کاملOptimal Coding for the Erasure Channel with Arbitrary Alphabet Size
An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes and linear random codes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2824244