The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The advantages of coded cooperative data exchange has been studied in the literature. In this problem, a group of wireless clients are interested in the same set of packets (a multicast scenario). Each client initially holds a subset of packets and wills to obtain its missing packets in a cooperative setting by exchanging packets with its peers. Cooperation via short range transmission links among...
We present an improved decoding algorithm for joint turbo decoding and physical-layer network coding. Instead of decoding the individual (binary) messages separately at the relay, the proposed algorithm, from the superimposed faded signals, yields an XOR estimate of the sent messages. Moreover, we introduce a softening of the XOR values to improve the overall performance. Simulation results show that...
In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public...
In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specifically, we ask whether the trade off between capacity and source independence is of continuous nature. We tie the question at hand to that of edge removal which has seen recent interest.
Recent research indicates that packet transmission employing random linear network coding can be regarded as transmitting subspaces over a linear operator channel (LOC). In this paper we propose the framework of linear operator broadcast channels (LOBCs) to model packet broadcasting over LOCs, and we do initial work on the capacity region of constant-dimension multiplicative LOBCs (CMLOBCs), a generalization...
In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or blocking by full buffers. We assert that because of RLNC, the content of buffers have dependencies which cannot be captured directly using the classical queueing...
We consider the multiple unicast problem under network coding over directed acyclic networks when there are two source-terminal pairs, s1 — t1 and s2 — t2. Current characterizations of the multiple unicast capacity region in this setting have a large number of inequalities, which makes them hard to explicitly evaluate. In this work we consider a slightly different problem. We assume that we only know...
A linear scheme is proposed for multiterminal secret key agreement under a private finite linear source model with public discussion. With a wiretapper observing the public discussion and a subset of the source components, it attains the secrecy capacity perfectly and non-asymptotically with a finite block length. Upper bounds on the block length and public discussion rate are given.
We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination...
We consider the problem of communicating the sum of m sources to n terminals in a directed acyclic network. Recently, it was shown that for a network of unit capacity links with either m = 2 or n = 2, the sum of the sources can be communicated to the terminals using scalar/vector linear network coding if and only if every source-terminal pair is connected in the network. We show in this paper that...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.