Upper Bounds on Separating Codes

DOI10.1109/TIT.2004.828140zbMath1296.94175MaRDI QIDQ3546728

Hans Georg Schaathun, Gérard D. Cohen

Publication date: 21 December 2008

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

zbMATH Keywords

hashingsuperimposed codesError-correcting codesseparating systems

Mathematics Subject Classification ID

Bounds on codes (94B65) Other designs, configurations (05B30)

Related Items (6)

Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ Separation and Witnesses ⋮ The \(t\)-wise intersection of relative two-weight codes ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ On generalized separating hash families ⋮ Yet another variation on minimal linear codes

This page was built for publication: Upper Bounds on Separating Codes