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.
An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages knowing a different set of messages a priori. The noiseless index coding problem is to identify the minimum number of transmissions (optimal length) to be made by the source through a noiseless channel so that all receivers can decode their wanted messages...
An index coding problem is symmetric if relative to its position, each receiver has identical sets of wanted messages and side information. We provide an algorithm to construct an optimal length scalar linear code for single unicast symmetric index coding problems with neighboring interference. First we compute the minimum number of independent dimensions required to avoid interference and show this...
Instantly Decodable Network Codes are of great interest in broadcast applications because of their properties like low decoding delay, low encoding and decoding complexities, and simple receiver requirements. This work explores two different multicast broadcast scenarios and gives instantly decodable index codes that perform better than codes in existing literature. First, we describe our novel Unequal...
An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messages a priori. The noiseless Index Coding Problem is to identify the minimum number of transmissions (optimal length) to be made by the source through noiseless channels so that all the receivers can decode their wanted messages...
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.