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.
This paper introduces an efficient polynomial-time code construction algorithm for cyclic networks, which achieves the optimal multicast rate. Until this work, no explicit capacity-achieving polynomial-time code construction for cyclic networks has been known. This new construction algorithm has the additional advantage that as sinks are added or removed from the network, it can modify the existing...
In this work we address the problem of network codes for cyclic networks. We show that network codes can be constructed for cyclic networks as long as at least one edge in each cycle has a delay, but it is not required that every edge would have a delay. We then present the algorithm for constructing an optimal multicast network code, developed in our previous work, and analyze its computational complexity,...
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.