Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In deep sub-micron ICs, growing amounts of ondie memory and scaling effects make embedded memories increasingly vulnerable to reliability and yield problems. As scaling progresses, soft and hard errors in the memory system will increase and single error ev ...
Decoding that uses an extended Hamming code in one of the primary stages of static encoding uses a calculation of the r+1 Hamming redundant symbols for k input symbols from which Hamming redundant symbols are calculated, where r satisfies 2.sup.r-1-r.ltore ...
This paper provides an inner bound to the rate-distortion region of a source coding setup in which two encoders are allowed some collaboration to describe a pair of discrete memoryless sources. We further require some robustness in case one of the encoders ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
We generalize the results about how to compute iterative decoding thresholds over the binary erasure channel of non-binary LDPC code ensembles of [16] to non-binary TLDPC codes [2], [3]. We show in this case how density evolution can be performed in order ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high probability. In [2], the authors describe a construction which can be used to yield a polynomially large family of codes of which a large fraction achieve the ...
We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbi- trary complexity, but the intermediate relay nodes are restricted to process only ...
Institute of Electrical and Electronics Engineers2007
The idea to use error-correcting codes in order to construct public key cryptosystems was published in 1978 by McEliece [ME1978]. In his original construction, McEliece used Goppa codes, but various later publications suggested the use of different familie ...
\begin{abstract} In this paper, we address an adaptive beamforming application in realistic acoustic conditions. After the position of a speaker is estimated by a speaker tracking system, we construct a subband-domain beamformer in \emph{generalized sidelo ...
We consider communication over a binary erasure channel with low density parity check codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code ensembles, in the asymptotic li ...
It is shown that a correlation inequality of statistical mechanics can be applied to linear low-density parity-check codes. Thanks to this tool we prove that, under a natural assumption, the exponential growth rate of regular low-density parity-check (LDPC ...
Institute of Electrical and Electronics Engineers2007
