Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests
From MaRDI portal
Publication:5324518
DOI10.2478/V10006-008-0030-YzbMath1178.94268OpenAlexW2133514126MaRDI QIDQ5324518
Publication date: 3 August 2009
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/207889
Hamming distanceGray codememory addressmemory testingMarch memory testmemory backgroundneighbourhood pattern sensitive faultsrandom-access memory (RAM)
Related Items (2)
Cites Work
- The repeated nondestructive march tests with variable address sequences
- Testing Memories for Single-Cell Pattern-Sensitive Faults
- Test Procedures for a Class of Pattern-Sensitive Faults in Semiconductor Random-Access Memories
- Detection oF Pattern-Sensitive Faults in Random-Access Memories
- A Survey of Combinatorial Gray Codes
This page was built for publication: Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests