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 contribution provides bounds on the list size of rank metric codes in order to understand whether polynomial-time list decoding is possible or not. First, an exponential upper bound is derived, which holds for any rank metric code of length n and minimum rank distance d. Second, a lower bound proves that there exists a rank metric code over Fqm of length n ≤ m such that the list size is exponential...
This work considers the multiple-access multicast error-correction scenario over a packetized network with z malicious edge adversaries. The network has min-cut m and packets of length l, and each sink demands all information from the set of sources S. The capacity region is characterized for both a “side-channel” model (where sources and sinks share some random bits that are secret from the adversary)...
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.