Frameproof Codes
From MaRDI portal
Publication:4443104
DOI10.1137/S0895480101384633zbMath1041.68063OpenAlexW4239254142MaRDI QIDQ4443104
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480101384633
Combinatorics in computer science (68R05) Cryptography (94A60) Extremal set theory (05D05) Other types of codes (94B60)
Related Items
List decoding for a multiple access hyperchannel, Strongly separable codes, Bounds and constructions for \(\overline{3}\)-separable codes with length 3, Separating Hash Families: A Johnson-type bound and New Constructions, Sliding-window dynamic frameproof codes, Sequential and dynamic frameproof codes, New upper bounds for parent-identifying codes and traceability codes, Improved bounds for separating hash families, \((2,1)\)-separating systems beyond the probabilistic bound, On tight bounds for binary frameproof codes, Near-sunflowers and focal families, Detecting arrays for effects of single factors, Improved upper bounds for the rate of separating and completely separating codes, Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3, Bounds for separating hash families, Optimal 2-traceability codes of length 4, Wide-sense 2-frameproof codes, Some intriguing upper bounds for separating hash families, New bounds on \(\bar{2}\)-separable codes of length 2, Asymptotically optimal \(\overline {2}\)-separable codes with length 4, On generalized separating hash families, New bounds on 2-frameproof codes of length 4, A tight bound for frameproof codes viewed in terms of separating hash families, A bound on the size of separating hash families, Improved bounds on 2-frameproof codes with length 4, Constructions and bounds for separating hash families, Unnamed Item, A note on \(\overline{2} \)-separable codes and \(B_2\) codes
