Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Closure solvability for network coding and secret sharing.

Gadouleau, Maximilien (2013) 'Closure solvability for network coding and secret sharing.', IEEE transactions on information theory., 59 (12). pp. 7858-7869.

Abstract

Network coding is a new technique to transmit data through a network by letting the intermediate nodes combine the packets they receive. Given a network, the network coding solvability problem decides whether all the packets requested by the destinations can be transmitted. In this paper, we introduce a new approach to this problem. We define a closure operator on a digraph closely related to the network coding instance and we show that the constraints for network coding can all be expressed according to that closure operator. Thus, a solution for the network coding problem is equivalent to a so-called solution of the closure operator. We can then define the closure solvability problem in general, which surprisingly reduces to finding secret-sharing matroids when the closure operator is a matroid. Based on this reformulation, we can easily prove that any multiple unicast where each node receives at least as many arcs as there are sources solvable by linear functions. We also give an alternative proof that any nontrivial multiple unicast with two source-receiver pairs is always solvable over all sufficiently large alphabets. Based on singular properties of the closure operator, we are able to generalize the way in which networks can be split into two distinct parts; we also provide a new way of identifying and removing useless nodes in a network. We also introduce the concept of network sharing, where one solvable network can be used to accommodate another solvable network coding instance. Finally, the guessing graph approach to network coding solvability is generalized to any closure operator, which yields bounds on the amount of information that can be transmitted through a network.

Item Type:Article
Keywords:Closure operators, Guessing games, Matroids, Network coding, Secret sharing.
Full text:(AM) Accepted Manuscript
Download PDF
(312Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1109/TIT.2013.2282293
Publisher statement:© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Date accepted:11 September 2013
Date deposited:21 October 2015
Date of first online publication:December 2013
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar