Upper Bounds on Separating Codes

DOI10.1109/TIT.2004.828140zbMATH Open1296.94175MaRDI QIDQ3546728FDOQ3546728

Authors Hans G. Schaathun, Gérard 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

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

Recommendations

• Bounds on the rate of separating codes
• LATIN 2004: Theoretical Informatics
• Improved upper bounds for the rate of separating and completely separating codes
• A bound for divisible codes
• On pair-separating codes
• Strongly separable codes
• Separable Codes
• scientific article; zbMATH DE number 1803256
• Cryptography and Coding
• Improved upper bounds on sizes of codes

Cited in

(14)

• On generalized separating hash families
• On the<tex>$
• Separation and Witnesses
• Improved upper bounds for the rate of separating and completely separating codes
• Combinatorial constructions of separating codes
• LATIN 2004: Theoretical Informatics
• Constructions of almost secure frameproof codes with applications to fingerprinting schemes
• New upper bounds on cardinality of separating systems
• A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system
• Bounds on the rate of disjunctive codes
• Yet another variation on minimal linear codes
• Bounds on the rate of separating codes
• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
• The \(t\)-wise intersection of relative two-weight codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546728)