The dissertation considers code constructions and bounds for unreliable, so-called partially stuck (defective) memory cells. Our new constructions can tolerate partially stuck cells while correcting substitution errors. In our constructions, the encoder outputs a word from an error-correcting code, and it could deliberately modify it to meet stuck-at constraints. Therefore, we show that treating some partially stuck cells as erroneous cells can decrease the required redundancy for some parameters. Lastly, we derive upper- and lower-like bounds based on our coding schemes.
«
The dissertation considers code constructions and bounds for unreliable, so-called partially stuck (defective) memory cells. Our new constructions can tolerate partially stuck cells while correcting substitution errors. In our constructions, the encoder outputs a word from an error-correcting code, and it could deliberately modify it to meet stuck-at constraints. Therefore, we show that treating some partially stuck cells as erroneous cells can decrease the required redundancy for some parameter...
»