Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The use of linear sums in exhaustive testing

From MaRDI portal
Publication:1101069
Jump to:navigation, search

DOI10.1016/0898-1221(87)90077-0zbMath0641.94034OpenAlexW2081035247MaRDI QIDQ1101069

S. B. Akers

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90077-0


zbMATH Keywords

VLSIexhaustive testing


Mathematics Subject Classification ID


Related Items (2)

Spinors and multivectors as a unified tool for spacetime geometry and for elementary particle physics ⋮ Magnetic charges, inertia, and arrow of time




Cites Work

  • Exhaustive Test Pattern Generation with Constant Weight Vectors
  • Verification Testing—A Pseudoexhaustive Test Technique
  • Logic Test Pattern Generation Using Linear Codes
  • Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing
  • The Weighted Syndrome Sums Approach to VLSI Testing




This page was built for publication: The use of linear sums in exhaustive testing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1101069&oldid=13136739"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki