On tight bounds for binary frameproof codes-Reference-Cited by-同舟云学术

On tight bounds for binary frameproof codes

Published:2015-02-18 Issue:2-3 Volume:77 Page:301-319
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Guo Chuan,Stinson Douglas R.,van Trung Tran

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-015-0037-y.pdf

Reference12 articles.

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

2. Blackburn, S.R.: Frameproof codes. SIAM J. Discrete Math. 16, 499–510 (2003)

3. Boneh, D., Shaw, J.: Collusion-free fingerprinting for digital data. IEEE Trans. Inform. Theory 44, 1897–1905 (1998)

4. Lecture Notes in Computer Science;B Chor,1994

5. Colbourn C.J., Horsley D., Syrotiuk V.R.: Frameproof codes and compressive sensing, forty-eighth annual allerton conference, Allerton House, UIUC, Illinois, USA, Sept 29–Oct 1, 2010, 985–990 (2010)

Cited by 5 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. Some intriguing upper bounds for separating hash families;Science China Mathematics;2018-09-19

4. Constructions and bounds for separating hash families;Discrete Mathematics;2018-09

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