Sciweavers

CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 10 months ago
Estimating the Lengths of Memory Words
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
Gusztáv Morvai, Benjamin Weiss
DFT
2007
IEEE
135views VLSI» more  DFT 2007»
14 years 5 months ago
Fault Secure Encoder and Decoder for Memory Applications
We introduce a reliable memory system that can tolerate multiple transient errors in the memory words as well as transient errors in the encoder and decoder (corrector) circuitry....
Helia Naeimi, André DeHon