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.
We consider the problem of multicasting information from a source to a destination over a multihop network of intermediate relays. However, some of the relays are untrustworthy and may be subject to eavesdropping. The source wishes to enlist their help while keeping the message secret against the eavesdropper. By employing random linear network coding at the relays, the problem is modeled as a noncoherent...
In this work, we study the problem of linear index coding from graph homomorphism point of view. We show that the decision version of linear (scalar or vector) index coding problem is equivalent to certain graph homomorphism problem. Using this equivalence expression, we conclude the following results. First we introduce new lower bounds on linear index of graphs. Next, we show that if the linear...
The classical discrete memoryless network (DMN) is characterized by one channel and every node in the network incurs a delay. On the other hand, the generalized DMN can be characterized by multiple channels and some nodes in the network may incur no delay. It is well-known that the classical cut-set bound serves as an outer bound for the classical DMN, but it is not applicable to some generalized...
While network coding promises to increase throughput, network nodes incur increased complexity as they are relied on to perform packet mixing. Previous works have proposed to manage network-level complexity by reducing the number of network coding transport nodes. Here, we study the tradeoff between transport-node complexity and achievable throughput rates. We compare two encoding schemes: recursive...
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.