Intersecting codes and independent families

DOI10.1109/18.340462zbMath0826.94027OpenAlexW2134959754MaRDI QIDQ4850288

Gilles Zémor, Gérard D. Cohen

Publication date: 9 October 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.340462

zbMATH Keywords

derandomizationVLSI testing\(t\)-independent families of binary vectorsbinary intersecting code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)

Related Items (19)

Small Strong Blocking Sets by Concatenation ⋮ The fullrank value function ⋮ On the intersection of binary linear codes ⋮ Unnamed Item ⋮ Separation and Witnesses ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system ⋮ Separating codes and a new combinatorial search model ⋮ On the lower bound for the length of minimal codes ⋮ An application of coding theory to estimating Davenport constants ⋮ Structures and lower bounds for binary covering arrays ⋮ The \(t\)-wise intersection of relative two-weight codes ⋮ The \(t\)-wise intersection and trellis of relative four-weight codes ⋮ Intersecting codes and separating codes ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ The separation of binary relative three-weight codes and its applications ⋮ On the constructions of highly nonlinear zigzag functions and unbiased functions ⋮ On the state of strength-three covering arrays ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes

This page was built for publication: Intersecting codes and independent families