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 a distributed parameter estimation problem, in which multiple terminals send messages related to their local observations using limited rates to a fusion center who will obtain an estimate of a parameter related to observations of all terminals. It is well known that if the transmission rates are in the Slepian-Wolf region, the fusion center can fully recover all observations and hence...
The achievable information rate region problem of multisource multisink network coding for general acyclic networks with arbitrary transmission requirements has previously been studied, where inner and outer bounds on the region were derived in terms of , the fundamental region of entropy functions. In this paper, we derive the exact characterization of the achievable rate region in...
The capacity problem for general acyclic multi-source multi-sink networks with arbitrary transmission requirements has been studied in [1], [2] and [3]. Specifically, inner and outer bounds of the capacity region were derived respectively in terms of ??*n and ??_*n, the fundamental regions of the entropy function. In this paper, we show that by carefully bounding the constrained regions in the entropy...
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.