New Bounds for Frameproof Codes

DOI10.1109/TIT.2017.2745619MaRDI QIDQ4566557zbMATH OpenOpenAlexFDO

Authors Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao

Publication date 27 June 2018

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

Full work available at URL https://arxiv.org/abs/1411.5782

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: Frameproof codes are used to fingerprint digital data. It can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for $w$-frameproof codes of length $N$ over an alphabet of size $q$. The upper bound is based on a combinatorial approach and the lower bound is based on a probabilistic construction. Both bounds can improve previous results when $q$ is small compared to $w$, say $cqleqw$ for some constant $cleqq$. Furthermore, we pay special attention to binary frameproof codes. We show a binary $w$-frameproof code of length $N$ can not have more than $N$ codewords if $$.

Cited in

(19)

• New upper bounds for parent-identifying codes and traceability codes
• Some intriguing upper bounds for separating hash families
• Improved bounds on 2-frameproof codes with length 4
• New bounds on 2-frameproof codes of length 4
• Wide-sense 2-frameproof codes
• Improved Constructions of Frameproof Codes
• Almost separating and almost secure frameproof codes over q-ary alphabets
• Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
• Cover-free codes and separating system codes
• Symmetric disjunctive list-decoding codes
• Comments on "New results on frame-proof codes and traceability schemes
• Secure Frameproof Code Through Biclique Cover
• Detecting arrays for effects of single factors
• Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
• New upper bounds for wide-sense frameproof codes
• On anti-collusion codes for averaging attack in multimedia fingerprinting
• Constructions and bounds for separating hash families
• Constructions of \(\bar{3}\)-separable codes with length 4
• On tight bounds for binary frameproof codes

This page was built for publication: New Bounds for Frameproof Codes

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