Funder
Guangxi Nature Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference20 articles.
1. Bazrafshan M., van Trung T.: On optimal bounds for separating hash families. In: Germany-Africa Workshop on Information and Communication Technology, Essen, Germany (2008).
2. Bazrafshan M., van Trung T.: Improved bounds for separating hash families. Des. Codes Cryptogr. 69, 369–382 (2013).
3. Blackburn S.R.: Frameproof codes. SIAM J. Discret. Math. 16, 499–510 (2003).
4. Blackburn S.R., Etzion T., Stinson D.R., Zaverucha G.M.: A bound on the size of separating hash families. J. Comb. Theory A 115, 1246–1256 (2008).
5. Blackburn S.R., Etzion T., Ng S.: Traceability codes. J. Comb. Theory A 117, 1049–1057 (2010).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New Bounds on 2-Frameproof Codes of Length 4;International Journal of Mathematics and Mathematical Sciences;2020-01-23