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.
In this paper, we characterize the capacity of a class of single-source single-destination discrete memoryless relay networks with an arbitrary number of nodes. In this class, the network is assumed to have a tree topology where the root node is the source, each parent node in the graph has at most one noisy child node and any number of noiseless child nodes, and the set of leaf nodes is the destination...
In many known examples where compress-and-forward (CF) for relay networks is capacity achieving, it is only trivially so, i.e., it falls back to hashing without quantization. A potentially better strategy is to decode as much as possible and to compress the residual information, i.e., a combination of decode-and-forward (DF) and CF (Cover and El Gamal's Theorem 7). Indeed such a strategy was shown...
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.