On the public citation graph

A parity bit signature for exhaustive testing

0 signed · 50 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/irepgelc.1954.6499441openalex-snapshot
Application of Boolean algebra to switching circuit design and to error detection
inferredcites →https://doi.org/10.1109/mdt.1985.294856openalex-snapshot
Built-In Self-Test Techniques
inferredcites →https://doi.org/10.1109/mdt.1985.294857openalex-snapshot
Built-In Self-Test Structures
inferredcites →https://doi.org/10.1109/t-c.1975.224205openalex-snapshot
Polynomially Complete Fault Detection Problems
inferredcites →https://doi.org/10.1109/tc.1976.1674661openalex-snapshot
Transition Count Testing of Combinational Logic Circuits
inferredcites →https://doi.org/10.1109/tc.1980.1675603openalex-snapshot
Syndrome-Testable Design of Combinational Circuits
inferredcites →https://doi.org/10.1109/tc.1980.1675610openalex-snapshot
Measures of the Effectiveness of Fault Signature Analysis
inferredcites →https://doi.org/10.1137/0107041openalex-snapshot
On a Theory of Boolean Functions
inferredcites →https://doi.org/10.1145/22145.22196openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1145/357062.357071openalex-snapshot
A fast algorithm for finding dominators in a flowgraph
inferredcites →https://doi.org/10.21236/ada096310openalex-snapshot
Testability and Reliability of LSI.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf00135231openalex-snapshot
Analysis of Hamming count compaction scheme
inferred← citeshttps://doi.org/10.1007/bf00135443openalex-snapshot
Constrained parity testing
inferred← citeshttps://doi.org/10.1007/bf00136077openalex-snapshot
Balance testing and balance-testable design of logic circuits
inferred← citeshttps://doi.org/10.1007/bf00137393openalex-snapshot
Multiple-output parity bit signature for exhaustive testing
inferred← citeshttps://doi.org/10.1007/bf00159830openalex-snapshot
Parity bit calculation and test signal compaction for BIST applications
inferred← citeshttps://doi.org/10.1049/iet-cds:20070119openalex-snapshot
Aliasing-free compaction revisited
inferred← citeshttps://doi.org/10.1049/ip-cds:20045050openalex-snapshot
Self-testing of cores-based embedded systems with built-in hardware
inferred← citeshttps://doi.org/10.1080/00207219208925551openalex-snapshot
Structure of modulo-2 ring-sum canonical expansions for boolean functions
inferred← citeshttps://doi.org/10.1109/12.24287openalex-snapshot
Fault detection in combinational networks by Reed-Muller transforms
inferred← citeshttps://doi.org/10.1109/12.260644openalex-snapshot
Recursive pseudoexhaustive test pattern generation
inferred← citeshttps://doi.org/10.1109/12.42129openalex-snapshot
Design of parity testable combinational circuits
inferred← citeshttps://doi.org/10.1109/12.545969openalex-snapshot
Programmable BIST space compactors
inferred← citeshttps://doi.org/10.1109/12.61051openalex-snapshot
Group theoretic signature analysis
inferred← citeshttps://doi.org/10.1109/12.90252openalex-snapshot
A new framework for designing and analyzing BIST techniques and zero aliasing compression
inferred← citeshttps://doi.org/10.1109/19.982974openalex-snapshot
Fault tolerance in systems design in VLSI using data compression under constraints of failure probabilities
inferred← citeshttps://doi.org/10.1109/19.989919openalex-snapshot
Data compression in space under generalized mergeability based on concepts of cover table and frequency ordering
inferred← citeshttps://doi.org/10.1109/43.7806openalex-snapshot
Circuits for pseudoexhaustive test pattern generation
inferred← citeshttps://doi.org/10.1109/92.365455openalex-snapshot
Cumulative balance testing of logic circuits
inferred← citeshttps://doi.org/10.1109/ats.2001.990335openalex-snapshot
Non-exhaustive parity testing
inferred← citeshttps://doi.org/10.1109/ftcs.1993.627337openalex-snapshot
Programmable space compaction for BIST
inferred← citeshttps://doi.org/10.1109/icvd.1996.489629openalex-snapshot
Syndrome signature in output compaction for VLSI BIST
inferred← citeshttps://doi.org/10.1109/imtc.2000.846856openalex-snapshot
Data compression in space under generalized mergeability based on concepts of cover table and frequency ordering
inferred← citeshttps://doi.org/10.1109/imtc.2002.1006911openalex-snapshot
Fault simulation and response compaction in full scan circuits using HOPE
inferred← citeshttps://doi.org/10.1109/imtc.2005.1604095openalex-snapshot
Space Compactor Design in VLSI Circuits Based on Graph Theoretic Concepts
inferred← citeshttps://doi.org/10.1109/imtc.2006.328306openalex-snapshot
On a New Graph Theory Approach to Designing Zero-Aliasing Space Compressors for Built-In Self-Testing
inferred← citeshttps://doi.org/10.1109/mwscas.1990.140717openalex-snapshot
A syndrome signature for exhaustive testing of combinational circuits
inferred← citeshttps://doi.org/10.1109/mwscas.2000.951619openalex-snapshot
Parity bit signature in response data compaction and built-in self-testing of VLSI circuits with compact test sets
inferred← citeshttps://doi.org/10.1109/seeda-cecnsm49515.2020.9221815openalex-snapshot
One Dimensional Cross-Correlation Methods For Deterministic And Stochastic Graph Signals With A Twitter Application In Julia
inferred← citeshttps://doi.org/10.1109/tc.2019.2907238openalex-snapshot
An ALU Protection Methodology for Soft Processors on SRAM-Based FPGAs
inferred← citeshttps://doi.org/10.1109/test.1991.519769openalex-snapshot
Parity Bit Calculation and Test Signal Compaction for BTST Applications
inferred← citeshttps://doi.org/10.1109/tim.2003.818547openalex-snapshot
Parity bit signature in response data compaction and built-in self-testing of VLSI circuits with nonexhaustive test sets
inferred← citeshttps://doi.org/10.1109/tim.2005.847352openalex-snapshot
Getting Errors to Catch Themselves—Self-Testing of VLSI Circuits With Built-In Hardware
inferred← citeshttps://doi.org/10.1109/tim.2005.855085openalex-snapshot
Revisiting Response Compaction in Space for Full-Scan Circuits With Nonexhaustive Test Sets Using Concept of Sequence Characterization
inferred← citeshttps://doi.org/10.1109/tim.2005.858102openalex-snapshot
Fault Simulation and Response Compaction in Full Scan Circuits Using HOPE
inferred← citeshttps://doi.org/10.1109/tim.2006.876523openalex-snapshot
Space Compactor Design in VLSI Circuits Based on Graph Theoretic Concepts
inferred← citeshttps://doi.org/10.1109/tim.2007.910004openalex-snapshot
On a New Graph Theory Approach to Designing Zero-Aliasing Space Compressors for Built-In Self-Testing
inferred← citeshttps://doi.org/10.1109/tvlsi.2020.2968365openalex-snapshot
ER-TCAM: A Soft-Error-Resilient SRAM-Based Ternary Content-Addressable Memory for FPGAs
inferred← citeshttps://doi.org/10.1155/1998/45472openalex-snapshot
Syndrome Signature in Output Compaction for VLSI Built‐in Self‐Test
inferred← citeshttps://doi.org/10.35940/ijitee.d8522.0210421openalex-snapshot
Design a Low Power and High Speed Parity Checker using Exclusive or Gates
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.