More on (2,2)-separating systems
From MaRDI portal
Publication:4677581
DOI10.1109/TIT.2002.801479zbMath1062.94074MaRDI QIDQ4677581
Hans Georg Schaathun, Sylvia B. Encheva, Gérard D. Cohen
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (10)
The fullrank value function ⋮ On the intersection of binary linear codes ⋮ Improved bounds for separating hash families ⋮ A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system ⋮ Value functions and two classes of binary codes ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ Binary fingerprinting codes ⋮ Intersecting codes and separating codes ⋮ The separation of binary relative three-weight codes and its applications ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes
This page was built for publication: More on (2,2)-separating systems
