A tight bound for frameproof codes viewed in terms of separating hash families-Reference-Cited by-同舟云学术

A tight bound for frameproof codes viewed in terms of separating hash families

Published:2013-02-19 Issue:3 Volume:72 Page:713-718
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Trung Tran van

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-013-9800-0.pdf

Reference20 articles.

1. Bazrafshan M., van Trung T.: Bounds for separating hash families. J. Comb. Theory Ser. A 118, 1129–1135 (2011)

2. Bazrafshan M.: Separating hash families, PhD thesis, University of Duisburg-Essen (2011)

3. Bazrafshan M., van Trung T.: Improved bounds for separating hash families. Des. Codes Cryptogr. (2012). doi: 10.1007/s10623-012-9673-7

4. Blackburn S.R.: Frameproof codes. SIAM J. Discret. Math. 16(3), 499–510 (2003)

5. Blackburn S.R., Etzion T., Stinson D.R., Zaverucha G.M.: A bound on the size of separating hash families. J. Comb. Theory Ser. A 115, 1246–1256 (2008)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures;2023 IEEE Information Theory Workshop (ITW);2023-04-23

2. Wide-sense 2-frameproof codes;Designs, Codes and Cryptography;2020-09-12

3. New Bounds on 2-Frameproof Codes of Length 4;International Journal of Mathematics and Mathematical Sciences;2020-01-23

4. Improved bounds on 2-frameproof codes with length 4;Designs, Codes and Cryptography;2018-05-09

5. New Bounds for Frameproof Codes;IEEE Transactions on Information Theory;2017-11