New bounds on 2-frameproof codes of length 4

DOI10.1155/2020/4879108zbMath1486.94185OpenAlexW3001083803WikidataQ126306811 ScholiaQ126306811MaRDI QIDQ1989034

Penying Rochanakul

Publication date: 24 April 2020

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/4879108

zbMATH Keywords

digital fingerprintingcodewords

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)

Cites Work

• A bound on the size of separating hash families
• Improved bounds on 2-frameproof codes with length 4
• A tight bound for frameproof codes viewed in terms of separating hash families
• Bounds for separating hash families
• On generalized separating hash families
• Improved Constructions of Frameproof Codes
• Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• New Bounds for Frameproof Codes
• Collusion-secure fingerprinting for digital data

This page was built for publication: New bounds on 2-frameproof codes of length 4