Improved bounds on 2-frameproof codes with length 4
From MaRDI portal
Publication:1755996
DOI10.1007/s10623-018-0490-5zbMath1403.94127OpenAlexW2799736692MaRDI QIDQ1755996
Minquan Cheng, Qiang Wang, Jing Jiang
Publication date: 11 January 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0490-5
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)
Related Items (1)
Cites Work
- Unnamed Item
- Improved bounds for separating hash families
- New bounds on \(\bar{2}\)-separable codes of length 2
- On tight bounds for binary frameproof codes
- A bound on the size of separating hash families
- On codes with the identifiable parent property
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Traceability codes
- 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
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- New Bounds for Frameproof Codes
- Asymptotic bounds on frameproof codes
- Collusion-secure fingerprinting for digital data
- Separable Codes
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
This page was built for publication: Improved bounds on 2-frameproof codes with length 4
