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 work, we consider achievable secrecy rates for symmetric K-user (K ges 3) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels. Achievable secrecy rates are derived for very strong interference. In addition, we derive the secure degrees of freedom for a range of channel parameters. As a by-product...
An algorithm for enumeration and de-numeration of run-length-limited words (dklr-sequences) is proposed. The complexity of the algorithm does not exceed O(log3 n log log n), where n is the length of word, whereas known methods have the complexity that is not less than c n, c > 0.
In this paper, we discuss the problem that how to realize the context-ware wrapping. We consider the peer sources to facilitate the matching task and enhance a wrapperpsilas extraction accuracy by leverage the peer wrappers or domain rule. First, we bring in the concept context-ware wrapping. With the problem how to realize it, then we propose a spiral-decoding method to synchronize the extractions...
In this paper, a simplified decoding algorithm of the (23, 12, 7) Golay code with error-correcting capacity less than or equal to 3 is proposed. The simulation result of the decoding algorithm is shown that all correctable error patterns are decoded successfully via the simplified decoding algorithm.
In this paper, a decoding method to use Euclidean algorithm for binary quadratic residue codes is proposed. A computer simulation has been executed successfully to decode Golay code and quadratic residue code of length 41.
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.