Constructions of 3-separable codes with length 4

DOI10.1007/S12095-026-00874-2MaRDI QIDQ7290189zbMATH OpenFDO

Authors Caihong Zhao, Jing Jiang

Publication date 7 July 2026

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12095-026-00874-2

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)

Cites work

• \((2,1)\)-separating systems beyond the probabilistic bound
• \(\overline{2}\)-separable codes with length 5
• A tight bound for frameproof codes viewed in terms of separating hash families
• Asymptotic bounds on frameproof codes
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• Bounds and constructions for \(\overline{3}\)-separable codes with length 3
• Bounds on the rate of separating codes
• Collusion-secure fingerprinting for digital data
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• Frameproof Codes
• Improved Constructions of Frameproof Codes
• New Bounds for Frameproof Codes
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• Probabilistic Existence Results for Separable Codes
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Separable Codes
• Some intriguing upper bounds for separating hash families

This page was built for publication: Constructions of \(\bar{3}\)-separable codes with length 4

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