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 present a class of algorithms for encoding data in memories with stuck cells. These algorithms rely on earlier code constructions termed cyclic Partitioned Linear Block Codes. For the corresponding q-ary BCH-like codes for u stucks in a codeword of length n, our encoding algorithm has complexity O((u logq n)2) Fq operations, which we will show compares favorably to a generic approach based on Gaussian...
Network coding has been successfully applied in large-scale content dissemination systems. While network codes provide optimal throughput, its current forms suffer from a high decoding complexity. This is an issue when applied to systems composed of nodes with low processing capabilities, such as sensor networks. In this paper, we propose a novel network coding approach based on LT codes, initially...
We present two results related to the computational complexity of lossy compression. The first result shows that for a memoryless source Ps with rate-distortion function R(D), the rate-distortion pair (R(D) + gamma, D + isin) can be achieved with constant decoding time per symbol and encoding time per symbol proportional to C1(gamma)isin-C2(gamma). The second results establishes that for any given...
We construct binary linear codes that are efficiently list- decodable up to a fraction (1/2 - epsiv) of errors. The codes encode k bits into n = poly(k/epsiv) bits and are constructible and list-decodable in time polynomial in k and 1/epsiv (in particular, in our results epsiv need not be constant and can even be polynomially small in n). Our results give the best known polynomial dependence of n...
In this paper, a general framework which enables to compare previously proposed block decoding approaches for the fast correlation attack is developed. All attacks are based on decoding using a set of parity check sums of an underlying linear code. The purpose of this paper is twofold: 1) to provide a simple close form estimate about the number of check sums of a particular structure necessary for...
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.