New Bounds for Frameproof Codes

DOI10.1109/TIT.2017.2745619zbMath1390.94884arXiv1411.5782OpenAlexW2963896203MaRDI QIDQ4566557

Xin Wang, Gennian Ge, Ying Miao, Chong Shangguan

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)

Related Items (10)

New upper bounds for parent-identifying codes and traceability codes ⋮ On tight bounds for binary frameproof codes ⋮ Detecting arrays for effects of single factors ⋮ Wide-sense 2-frameproof codes ⋮ Some intriguing upper bounds for separating hash families ⋮ Cover-free codes and separating system codes ⋮ Symmetric disjunctive list-decoding codes ⋮ New bounds on 2-frameproof codes of length 4 ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ Constructions and bounds for separating hash families

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